arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 2311.06111cs.DScs.CG
收藏

带离群点的最小半径和问题的 $(3+ε)$ 近似算法及广义下界扩展

A $(3+ε)$-approximation algorithm for the minimum sum of radii problem with outliers and extensions for generalized lower bounds

Moritz Buchem, Katja Ettmayr, Hugo Kooki Kasuya Rosado, Andreas Wiese

AI总结:

本文提出原始-对偶算法,将带离群点的最小半径和问题的近似比从3.389和12.365改进至3+ε,并推广至广义下界设置,实现3.5+ε近似。

摘要:

给定度量空间中的一组点和一个整数 $k$,我们寻求将这些点划分为 $k$ 个簇。对于每个计算出的簇,通常定义其中一个点作为簇的中心。一个自然的目标是最小化簇中心半径之和,其中我们为每个中心分配最小的半径 $r$,使得簇中每个点到中心的距离至多为 $r$。该问题已知最佳多项式时间近似比为 $3.389$。在带离群点的设置中,即给定整数 $m$ 并允许最多 $m$ 个点不属于任何簇,已知最佳近似因子为 $12.365$。\n\n在本文中,我们将两个近似比均改进为 $3+ε$。我们的算法是原始-对偶算法,使用全新的思想来计算解并保证所声称的近似比。例如,我们用一种原始-对偶例程替换经典的二分搜索来寻找拉格朗日乘子 $λ$ 的最佳值,在该例程中 $λ$ 是一个被提升的变量。此外,我们证明对于由几乎紧的对偶约束产生的每个连通分量,我们可以找到一个覆盖其所有点的单个簇,并通过新的原始-对偶分析来限制其成本。我们指出,我们的近似因子 $3+ε$ 是文献中已知方法的自然极限。\n\n然后,我们将结果扩展到下界设置。对于每个点 $i$ 存在下界 $L_{i}$ 的情况已有已知算法,该下界表明如果 $i$ 是簇中心,则我们需要至少分配 $L_{i}$ 个客户给 $i$。对于此设置,在不允许离群点时存在 $3.83$ 近似,在带离群点时存在 ${12.365}$ 近似。我们将两个比率均改进为 $3.5 + ε$,同时推广了允许的下界类型。

英文摘要:

For a given set of points in a metric space and an integer $k$, we seek to partition the given points into $k$ clusters. For each computed cluster, one typically defines one point as the center of the cluster. A natural objective is to minimize the sum of the cluster center's radii, where we assign the smallest radius $r$ to each center such that each point in the cluster is at a distance of at most $r$ from the center. The best-known polynomial time approximation ratio for this problem is $3.389$. In the setting with outliers, i.e., we are given an integer $m$ and allow up to $m$ points that are not in any cluster, the best-known approximation factor is $12.365$. In this paper, we improve both approximation ratios to $3+ε$. Our algorithms are primal-dual algorithms that use fundamentally new ideas to compute solutions and to guarantee the claimed approximation ratios. For example, we replace the classical binary search to find the best value of a Lagrangian multiplier $λ$ by a primal-dual routine in which $λ$ is a variable that is raised. Also, we show that for each connected component due to almost tight dual constraints, we can find one single cluster that covers all its points and we bound its cost via a new primal-dual analysis. We remark that our approximation factor of $3+ε$ is a natural limit for the known approaches in the literature. Then, we extend our results to the setting of lower bounds. There are algorithms known for the case that for each point $i$ there is a lower bound $L_{i}$, stating that we need to assign at least $L_{i}$ clients to $i$ if $i$ is a cluster center. For this setting, there is a $ 3.83$ approximation if outliers are not allowed and a ${12.365}$-approximation with outliers. We improve both ratios to $3.5 + ε$ and, at the same time, generalize the type of allowed lower bounds.

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

↑