The capacitated K-center problem is a fundamental 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 s 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.
CITATION STYLE
Khuller, S., & Sussmann, Y. J. (1996). The capacitated K-center problem (Extended abstract). In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 1136, pp. 152–166). Springer Verlag. https://doi.org/10.1007/3-540-61680-2_53
Mendeley helps you to discover research relevant for your work.