@inproceedings{65ff3012820946e6816d2d6b81f023c0,
title = "The capacitated K-center problem (Extended abstract)",
abstract = "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.",
author = "Samir Khuller and Sussmann, {Yoram J.}",
note = "Publisher Copyright: {\textcopyright} Springer-Verlag Berlin Heidelberg 1996. Copyright: Copyright 2016 Elsevier B.V., All rights reserved.; 4th European Symposium on Algorithms, ESA 1996 ; Conference date: 25-09-1996 Through 27-09-1996",
year = "1996",
doi = "10.1007/3-540-61680-2_53",
language = "English (US)",
isbn = "3540616802",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
publisher = "Springer Verlag",
pages = "152--166",
editor = "Josep Diaz and Maria Serna",
booktitle = "Algorithms - ESA 1996 - 4th Annual European Symposium, Proceedings",
}