In capacitated $(k,z)$-clustering, we open $k$ centers and assign every client to a center within its capacity, minimizing the sum of $z$-th powers of the distances; $k$-median and $k$-means are the cases $z=1$ and $z=2$. We study polynomial-time algorithms that open $k+\lfloor\varepsilon k\rfloor$ centers but respect the capacities exactly. All ratios hold up to an additive $δ$ for every fixed $δ>0$. For uniform soft capacities in low dimensions, we obtain ratio $β-(β-1)\varepsilon$, where $β=3^z$ if the clients or the locations have bounded doubling dimension, and $β=\mathcal{B}_z<3^z$ for $z>1$ if the clients do and centers may lie anywhere in $\mathbb{R}^d$. This gives $3-2\varepsilon$ for $k$-median and $5-4\varepsilon$ for Euclidean $k$-means. We also obtain ratios bounded by a constant for hard capacities, and $1+(3^z-1)e^{-\varepsilon}$ for non-uniform soft capacities. These are the first polynomial-time ratios with $(1+\varepsilon)k$ centers that are bounded by a constant, apart from uniform $k$-median in the plane. For uniform $k$-median in general metrics, we obtain $3+2\ln(1/\varepsilon)$ with soft and $7+2\ln(1/\varepsilon)$ with hard capacities, improving the previous $O(\varepsilon^{-2}\log(1/\varepsilon))$. Splitting the clusters of a near-optimal uncapacitated solution into groups of at most $U$ clients, where $U$ is the capacity, gives fewer than $2k$ groups. With fewer centers, groups must share centers. Each extra center gives private centers to about two groups, since a center of an optimal solution that serves only such groups can be closed. Thus $\lfloor\varepsilon k\rfloor$ extra centers remove almost an $\varepsilon$-fraction of the extra cost caused by sharing.

翻译：暂无翻译