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

DOI10.1287/MOOR.12.2.255MaRDI QIDQ3760268zbMATH OpenOpenAlexWikidataFDO

Authors Zvi Drezner, S. Shelah

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

\(\epsilon \)-approximate solution1-center problemElzinga-Hearn algorithmfacility location in the plane

Mathematics Subject Classification ID

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

Recommendations

• The complexity of generalized center problem
• Un nuevo resultado sobre la complejidad del problema delP-centro
• Efficient algorithms for the one-dimensional \(k\)-center problem
• Optimal algorithms for constrained 1-center problems
• Generalized p-center problems: Complexity results and approximation algorithms
• The parameterized complexity of the shared center problem
• The parameterized complexity of the shared center problem
• On the complexity of the \((r|p)\)-centroid problem in the plane
• An O(nlogn) randomizing algorithm for the weighted euclidean 1-center problem
• An improvement and an extension of the Elzinga \& Hearn's algorithm to the 1-center problem in \(\mathbb{R}^ n\) with \(l_{2b}\)-norms

Cited in

(5)

• The slab dividing approach to solve the Euclidean \(P\)-center problem
• An improvement and an extension of the Elzinga \& Hearn's algorithm to the 1-center problem in \(\mathbb{R}^ n\) with \(l_{2b}\)-norms
• 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

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