We consider the capacitated $$k$$k-center problem. In this problem we are given a finite set of locations in a metric space and each location has an associated non-negative integer capacity. The goal is to choose (open) $$k$$k locations (called centers) and assign each location to an open center to minimize the maximum, over all locations, of the distance of the location to its assigned center. The number of locations assigned to a center cannot exceed the center’s capacity. The uncapacitated $$k$$k-center problem has a simple tight (Formula presented.)-approximation from the 80’s. In contrast, the first constant factor approximation for the capacitated problem was obtained only recently by Cygan, Hajiaghayi and Khuller who gave an intricate LP-rounding algorithm that achieves an approximation guarantee in the hundreds. In this paper we give a simple algorithm with a clean analysis and prove an approximation guarantee of (Formula presented.). It uses the standard LP relaxation and comes close to settling the integrality gap (after necessary preprocessing), which is narrowed down to either (Formula presented.). The algorithm proceeds by first reducing to special tree instances, and then uses our best-possible algorithm to solve such instances. Our concept of tree instances is versatile and applies to natural variants of the capacitated $$k$$k-center problem for which we also obtain improved algorithms. Finally, we give evidence to show that more powerful preprocessing could lead to better algorithms, by giving an approximation algorithm that beats the integrality gap for instances where all non-zero capacities are the same.
|Number of pages||25|
|Publication status||Published - 2015 Dec 1|
Bibliographical notePublisher Copyright:
© 2015, Springer-Verlag Berlin Heidelberg and Mathematical Optimization Society.
All Science Journal Classification (ASJC) codes