An O(nlogn) randomizing algorithm for the weighted euclidean 1-center problem

DOI10.1016/0196-6774(86)90027-1MaRDI QIDQ3753765zbMATH OpenOpenAlexWikidataFDO

Authors Nimrod Megiddo, Eitan Zemel

Publication date 1986

Published in Journal of Algorithms (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0196-6774(86)90027-1

zbMATH Keywords

facility locationweighted Euclidean 1-center problemrandomizing algorithm

Mathematics Subject Classification ID

Inventory, storage, reservoirs (90B05)

Cited in

(11)

• Extending NC and RNC algorithms
• The connected k-vertex one-center problem on graphs
• Computing the center of uncertain points on tree networks
• On the Complexity of the Elzinga-Hearn Algorithm for the 1-Center Problem
• A linear time randomizing algorithm for searching ranked functions
• A simple linear algorithm for computing rectilinear 3-centers
• Prune-and-search with limited workspace
• An algorithm and a core set result for the weighted Euclidean one-center problem
• On the ball spanned by balls
• Rank-two update algorithm versus Frank-Wolfe algorithm with away steps for the weighted Euclidean one-center problem
• Computing the center of uncertain points on tree networks

This page was built for publication: An O(nlogn) randomizing algorithm for the weighted euclidean 1-center problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3753765)