A constant-factor approximation algorithm for the k-median problem
Journal of Computer and System Sciences - STOC 1999
Approximation Algorithms for Edge-Dilation k-Center Problems
SWAT '02 Proceedings of the 8th Scandinavian Workshop on Algorithm Theory
A simple linear algorithm for computing rectilinear 3-centers
Computational Geometry: Theory and Applications - Special issue: The 11th Candian conference on computational geometry - CCCG 99
An exact algorithm for the capacitated vertex p-center problem
Computers and Operations Research
Achieving anonymity via clustering
Proceedings of the twenty-fifth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
k-Center problems with minimum coverage
Theoretical Computer Science
A simple linear algorithm for computing rectilinear 3-centers
Computational Geometry: Theory and Applications - Special issue: The 11th Candian conference on computational geometry - CCCG 99
An exact algorithm for the capacitated vertex p-center problem
Computers and Operations Research
Achieving anonymity via clustering
ACM Transactions on Algorithms (TALG)
Distributed routing in tree networks with few landmarks
CAAN'06 Proceedings of the Third international conference on Combinatorial and Algorithmic Aspects of Networking
The fault tolerant capacitated k-center problem
SIROCCO'12 Proceedings of the 19th international conference on Structural Information and Communication Complexity
A model for minimizing active processor time
ESA'12 Proceedings of the 20th Annual European conference on Algorithms
| Hi-index | 0.00 |
The capacitated K-center problem is a basic facility location problem, where we are asked to locate K facilities in a graph and to assign vertices to facilities, so as to minimize the maximum distance from a vertex to the facility to which it is assigned. Moreover, each facility may be assigned at most L vertices. This problem is known to be NP-hard. We give polynomial time approximation algorithms for two different versions of this problem that achieve approximation factors of 5 and 6. We also study some generalizations of this problem.