Generalized \(p\)-center problems: Complexity results and approximation algorithms
type: Item
instance of: scholarly article
title: Generalized \(p\)-center problems: Complexity results and approximation algorithms
zbMATH Open document ID: 0918.90098
DOI: 10.1016/S0377-2217(96)00076-8
author: Dorit S. Hochbaum
author: Anu Pathria
published in: European Journal of Operational Research
publication date: 1999-08-24T00:00:00Z
Mathematics Subject Classification ID: 90B80
Mathematics Subject Classification ID: 90C60
zbMATH DE Number: 1252739
zbMATH Keywords: \(p\)-Center problems
zbMATH Keywords: NP-complete
zbMATH Keywords: polynomial time approximation
MaRDI profile type: Publication
cites work: Q3056948
cites work: On the Complexity of Timetable and Multicommodity Flow Problems
cites work: Q4198056
cites work: Clustering to minimize the maximum intercluster distance
cites work: The slab dividing approach to solve the Euclidean \(P\)-center problem
cites work: On alternativep-center problems
cites work: Q4142699
cites work: An Algorithmic Approach to Network Location Problems. I: Thep-Centers
cites work: Linear-Time Algorithms for Linear Programming in $R^3 $ and Related Problems
Recommended article: The complexity of generalized center problem
Recommended article: Un nuevo resultado sobre la complejidad del problema delP-centro
Recommended article: Optimal algorithms for the \(\alpha\)-neighbor \(p\)-center problem
Recommended article: Approximability results for the converse connectedp-centre problem†
Recommended article: Approximation algorithms for diversity-bounded center problems
Recommended article: The p-Centre Problem-Heuristic and Optimal Algorithms
Recommended article: The generalized discrete ‐centroid problem
Recommended article: The approximability of the \(p\)-hub center problem with parameterized triangle inequality
Recommended article: Q4867319
Recommended article: On the complexity of the \((r|p)\)-centroid problem in the plane
description: scientific article; zbMATH DE number 1252739