The capacitated K-center problem
- 1 January 1996
- book chapter
- Published by Springer Nature
- p. 152-166
- https://doi.org/10.1007/3-540-61680-2_53
Abstract
No abstract availableKeywords
This publication has 14 references indexed in Scilit:
- On the hardness of approximating minimization problemsJournal of the ACM, 1994
- How to Allocate Network CentersJournal of Algorithms, 1993
- Optimal algorithms for approximate clusteringPublished by Association for Computing Machinery (ACM) ,1988
- A unified approach to approximation algorithms for bottleneck problemsJournal of the ACM, 1986
- A Best Possible Heuristic for the k-Center ProblemMathematics of Operations Research, 1985
- A simple heuristic for the p-centre problemOperations Research Letters, 1985
- Clustering to minimize the maximum intercluster distanceTheoretical Computer Science, 1985
- Easy and hard bottleneck location problemsDiscrete Applied Mathematics, 1979
- Optimal program and data locations in computer networksCommunications of the ACM, 1977
- Bottleneck extremaJournal of Combinatorial Theory, 1970