On the Complexity of the Elzinga-Hearn Algorithm for the 1-Center Problem

DOI10.1287/moor.12.2.255zbMath0622.90027OpenAlexW1991595252WikidataQ30040735 ScholiaQ30040735MaRDI QIDQ3760268

Saharon Shelah, Zvi Drezner

Publication date: 1987

Published in: Mathematics of Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1287/moor.12.2.255

zbMATH Keywords

1-center problemfacility location in the plane\(\epsilon \)-approximate solutionElzinga-Hearn algorithm

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Inventory, storage, reservoirs (90B05)

Related Items (3)

A planar minimax algorithm for analysis of coordinate measurements ⋮ Fixed gate point location problems ⋮ Continuous Center Problems

This page was built for publication: On the Complexity of the Elzinga-Hearn Algorithm for the 1-Center Problem