arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2603.28265cs.CGcs.CCcs.DS
收藏

连续欧几里得k中心问题的细粒度复杂度

Fine-Grained Complexity of Continuous Euclidean k-Center

University of Bonn(波恩大学);ETH Zurich(苏黎世联邦理工学院);Saarland University(萨尔兰大学);Max Planck Institute for Informatics(马克斯·普朗克计算机科学研究所);The University of Sheffield(谢菲尔德大学);Rutgers University(罗格斯大学);Hausdorff Center for Mathematics(豪斯多夫数学中心);Lamarr Institute for Machine Learning and Artificial Intelligence(拉玛尔机器学习与人工智能研究所);University of Massachusetts, Amherst(马萨诸塞大学阿默斯特分校);Aalto University(阿尔托大学)

Lotte Blank, Karl Bringmann, Parinya Chalermsook, Karthik C. S., Benedikt Kolbe, Hung Le, Geert van Wordragen

AI总结:

本文研究了连续欧几里得k中心问题的细粒度复杂度,基于ETH和3-SUM假设,建立了该问题在常数维度下的时间下界,证明了现有算法的最优性,并解决了2-中心和6-中心问题的开放问题。

摘要:

在连续欧几里得k中心问题中,给定n个点和整数k,目标是找到k个中心点,使得任意输入点到最近中心的欧几里得距离的最大值最小。本文在常数维度下建立了该问题的条件下界。在参数k的情况下,假设指数时间假设(ETH),证明了不存在f(k)n^{o(k^{1-1/d})}时间算法,表明Agarwal和Procopiuc的算法本质上是最优的。此外,我们的下界排除了任何(1+ε)近似算法在(k/ε)^{o(k^{1-1/d})}n^{O(1)}时间内运行的可能性。在小k的情况下,假设3-SUM假设,证明对于任何ε>0,不存在O(n^{2-ε})时间算法解决R^3中的2-中心问题,解决了Agarwal等人提出的开放问题。此外,在相同假设下,证明了R^2中的6-中心问题也不存在O(n^{2-ε})时间算法。所有证明的核心技术是一个新颖的几何嵌入线性方程组系统。我们构造了一个点集,其中每个变量对应特定的点集,几何结构确保小半径聚类仅当方程组有有效解时才可能。

英文摘要:

In the (continuous) Euclidean $k$-center problem, given $n$ points in $\mathbb{R}^d$ and an integer $k$, the goal is to find $k$ center points in $\mathbb{R}^d$ that minimize the maximum Euclidean distance from any input point to its closest center. In this paper, we establish conditional lower bounds for this problem in constant dimensions in two settings. $\bullet$ Parameterized by $k$: Assuming the Exponential Time Hypothesis (ETH), we show that there is no $f(k)n^{o(k^{1-1/d})}$-time algorithm for the Euclidean $k$-center problem. This result shows that the algorithm of Agarwal and Procopiuc [SODA 1998; Algorithmica 2002] is essentially optimal. Furthermore, our lower bound rules out any $(1+\varepsilon)$-approximation algorithm running in time $(k/\varepsilon)^{o(k^{1-1/d})}n^{O(1)}$, thereby establishing near-optimality of the corresponding approximation scheme by the same authors. $\bullet$ Small $k$: Assuming the 3-SUM hypothesis, we prove that for any $\varepsilon>0$ there is no $O(n^{2-\varepsilon})$-time algorithm for the Euclidean $2$-center problem in $\mathbb{R}^3$. This settles an open question posed by Agarwal, Ben Avraham, and Sharir [SoCG 2010; Computational Geometry 2013]. In addition, under the same hypothesis, we prove that for any $\varepsilon > 0$, the Euclidean $6$-center problem in $\mathbb{R}^2$ also admits no $O(n^{2-\varepsilon})$-time algorithm. The technical core of all our proofs is a novel geometric embedding of a system of linear equations. We construct a point set where each variable corresponds to a specific collection of points, and the geometric structure ensures that a small-radius clustering is possible if and only if the system has a valid solution.

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

↑