In this paper we consider a generalization of the classical k-center problem with capacities. Our goal is to select k centers in a graph, and assign each node to a nearby center, so that we respect the capacity constraints on centers. The objective is to minimize the maximum distance a node has to travel to get to its assigned center. This problem is NP -hard, even when centers have no capacity restrictions and optimal factor 2 approximation algorithms are known. With capacities, when all centers have identical capacities, a 6 approximation is known with no better lower bounds than for the infinite capacity version. While many generalizations and variations of this problem have been studied extensively, no progress was made on the capacitated version for a general capacity function. We develop the first constant factor approximation algorithm for this problem. Our algorithm uses an LP rounding approach to solve this problem, and works for the case of non-uniform hard capacities, when multiple copies of a node may not be chosen and can be extended to the case when there is a hard bound on the number of copies of a node that may be selected. Finally, for non-uniform soft capacities we present a much simpler 11approximation algorithm, which we find as one more evidence that hard capacities are much harder to deal with.
Cygan et al. REF give the first algorithm for capacitated k-center with non-uniform capacities by using an LP rounding algorithm.
LP Rounding for k-Centers with Non-uniform Hard Capacities
2012 IEEE 53rd Annual Symposium on Foundations of Computer Science
2012 IEEE 53rd Annual Symposium on Foundations of Computer Science
Computer Science Mathematics