最小化簇半径和的容量聚类问题的FPT常数近似
FPT Constant-Approximations for Capacitated Clustering to Minimize the Sum of Cluster Radii
AI总结:
针对一般度量空间下满足非均匀硬容量约束的最小化簇半径和聚类问题,提出了首个FPT常数因子近似算法,并在均匀容量下显著改进了近似界限。
摘要:
带有容量约束的聚类是一个多年来备受关注的基本问题。本文针对在一般度量空间中将点聚类为 $k$ 个簇以最小化簇半径之和、且满足非均匀硬容量约束的问题,给出了首个FPT常数因子近似算法。具体而言,我们给出了一个运行时间为 $2^{O(k^2\log k)}\cdot n^3$ 的 $(15+ε)$-近似算法。当容量均匀时,我们获得了以下改进的近似界限:运行时间为 $2^{O(k\log(k/ε))}n^3$ 的 $(4+ε)$-近似,显著优于Inamdar和Varadarajan [ESA 2020] 的FPT 28-近似;在欧几里得空间中,运行时间为 $2^{O(k/ε^2 \cdot\log(k/ε))}dn^3$ 的 $(2+ε)$-近似,以及运行时间为 $2^{O(kd\log ((k/ε)))}n^3$ 的 $(1+ε)$-近似;如果允许以 $(1+ε)$-因子违反容量,则在欧几里得空间中存在运行时间为 $2^{O(k/ε^2 \cdot\log(k/ε))}dn^3$ 的 $(1+ε)$-近似。我们补充证明了,若不允许任何容量违反,则不存在运行时间为 $f(k)\cdot n^{O(1)}$ 的 $(1+ε)$-近似算法。
英文摘要:
Clustering with capacity constraints is a fundamental problem that attracted significant attention throughout the years. In this paper, we give the first FPT constant-factor approximation algorithm for the problem of clustering points in a general metric into $k$ clusters to minimize the sum of cluster radii, subject to non-uniform hard capacity constraints. In particular, we give a $(15+ε)$-approximation algorithm that runs in $2^{0(k^2\log k)}\cdot n^3$ time. When capacities are uniform, we obtain the following improved approximation bounds: A (4 + $ε$)-approximation with running time $2^{O(k\log(k/ε))}n^3$, which significantly improves over the FPT 28-approximation of Inamdar and Varadarajan [ESA 2020]; a (2 + $ε$)-approximation with running time $2^{O(k/ε^2 \cdot\log(k/ε))}dn^3$ and a $(1+ε)$-approximation with running time $2^{O(kd\log ((k/ε)))}n^{3}$ in the Euclidean space; and a (1 + $ε$)-approximation in the Euclidean space with running time $2^{O(k/ε^2 \cdot\log(k/ε))}dn^3$ if we are allowed to violate the capacities by (1 + $ε$)-factor. We complement this result by showing that there is no (1 + $ε$)-approximation algorithm running in time $f(k)\cdot n^{O(1)}$, if any capacity violation is not allowed.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。