关于非均匀$k$ -中心的扰动恢复性
On Perturbation Resilience of Non-Uniform $k$-Center
摘要:
Chakrabarty、Goyal和Krishnaswamy [ICALP,2016]最近将非均匀$k$中心(NUkC)问题表述为经典$k$中心聚类问题的推广。在NUkC中,给定度量空间中的一组$n$点$P$和非负数$r_1, r_2, \ldots , r_k$,目标是找到最小膨胀$α$,并为$1\le i\le k$选择以$P$的点为中心的$k$球,半径为$α\cdot r_i$,使得$P$的所有点都包含在所选球的并集中。他们表明,即使在树度量中,这个问题也是NP-难的。另一方面,他们设计了一种“双准则”常数近似算法,该算法使用常数乘以$k$球。令人惊讶的是,即使在$r_i$属于大小为3的固定集合的特殊情况下,也不知道真正的近似。本文研究了Bilu和Linial [Combinatorics,Probability and Computing,2012]提出的扰动恢复下的NUkC问题。我们证明了当$r_i$属于一个定长集时,在2-扰动恢复下的问题是多项式时间可解的。然而,我们表明扰动弹性在一般情况下没有帮助。特别是,我们的研究结果意味着,即使扰动弹性不能希望找到任何“好”的近似的问题。
英文摘要:
The Non-Uniform $k$-center (NUkC) problem has recently been formulated by Chakrabarty, Goyal and Krishnaswamy [ICALP, 2016] as a generalization of the classical $k$-center clustering problem. In NUkC, given a set of $n$ points $P$ in a metric space and non-negative numbers $r_1, r_2, \ldots , r_k$, the goal is to find the minimum dilation $α$ and to choose $k$ balls centered at the points of $P$ with radius $α\cdot r_i$ for $1\le i\le k$, such that all points of $P$ are contained in the union of the chosen balls. They showed that the problem is NP-hard to approximate within any factor even in tree metrics. On the other hand, they designed a "bi-criteria" constant approximation algorithm that uses a constant times $k$ balls. Surprisingly, no true approximation is known even in the special case when the $r_i$'s belong to a fixed set of size 3. In this paper, we study the NUkC problem under perturbation resilience, which was introduced by Bilu and Linial [Combinatorics, Probability and Computing, 2012]. We show that the problem under 2-perturbation resilience is polynomial time solvable when the $r_i$'s belong to a constant sized set. However, we show that perturbation resilience does not help in the general case. In particular, our findings imply that even with perturbation resilience one cannot hope to find any "good" approximation for the problem.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。