Generalized \(p\)-center problems: Complexity results and approximation algorithms

DOI10.1016/S0377-2217(96)00076-8zbMath0918.90098MaRDI QIDQ1278142

Anu Pathria, Dorit S. Hochbaum

Publication date: 24 August 1999

Published in: European Journal of Operational Research (Search for Journal in Brave)

zbMATH Keywords

NP-completepolynomial time approximation\(p\)-Center problems

Mathematics Subject Classification ID

Abstract computational complexity for mathematical programming problems (90C60) Discrete location and assignment (90B80)

Related Items (7)

Approximation schemes for the generalized extensible bin packing problem ⋮ Approximability results for the converse connectedp-centre problem^† ⋮ Covering moving points with anchored disks ⋮ Unnamed Item ⋮ Minimum-diameter covering problems ⋮ Insertion heuristics for central cycle problems ⋮ A multi-objective integrated facility location-hardening model: analyzing the pre- and post-disruption tradeoff

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Clustering to minimize the maximum intercluster distance
• The slab dividing approach to solve the Euclidean \(P\)-center problem
• Linear-Time Algorithms for Linear Programming in $R^3 $ and Related Problems
• An Algorithmic Approach to Network Location Problems. I: Thep-Centers
• On alternativep-center problems
• On the Complexity of Timetable and Multicommodity Flow Problems

This page was built for publication: Generalized \(p\)-center problems: Complexity results and approximation algorithms