arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2107.07358cs.DScs.CG
收藏

Euclidean k-均值的一个改进逼近

A Refined Approximation for Euclidean k-Means

Fabrizio Grandoni, Rafail Ostrovsky, Yuval Rabani, Leonard J. Schulman, Rakesh Venkat

摘要:

在欧几里德$k$ -均值问题中,我们给出了欧几里德空间中的$n$点的集合$D$和正整数$k$。我们的目标是在同一空间(中心)中识别一组$k$点,以最小化$D$中每个点与最近中心之间的欧氏距离平方和。已知该问题是APX困难的,并且当前最佳近似比是基于该问题的标准LP的原始-对偶$6.357$近似[Ahmadian et al. FOCS'17,SICOMP'20]。在本说明中,我们将展示如何一个小的修改艾哈迈迪等。的分析导致略微改进的$6.12903$近似。作为相关结果,我们还证明了所述线性规划至少具有$\frac{16+\sqrt{5}}{15}>1.2157$的完整性间隙.

英文摘要:

In the Euclidean $k$-Means problem we are given a collection of $n$ points $D$ in an Euclidean space and a positive integer $k$. Our goal is to identify a collection of $k$ points in the same space (centers) so as to minimize the sum of the squared Euclidean distances between each point in $D$ and the closest center. This problem is known to be APX-hard and the current best approximation ratio is a primal-dual $6.357$ approximation based on a standard LP for the problem [Ahmadian et al. FOCS'17, SICOMP'20]. In this note we show how a minor modification of Ahmadian et al.'s analysis leads to a slightly improved $6.12903$ approximation. As a related result, we also show that the mentioned LP has integrality gap at least $\frac{16+\sqrt{5}}{15}>1.2157$.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑