磁盘中的分散
Dispersion in disks
摘要:
我们提出了三个新的近似算法与改进的常数比选择$n$点在$n$磁盘,使点之间的最小成对距离最大化。(1)一个非常简单的$O(n\log n)$ -时间算法与比率$0.511$不相交的单位磁盘。(2)一种基于LP的算法,具有用于任意半径的不相交圆盘的比率$0.707$,该算法使用线性数量的变量和约束,并在多项式时间内运行。(3)一种混合算法,对于(不一定是不相交的)单位磁盘,具有$0.4487$或$0.4674$之比,它使用Cabello算法与简单的$O(n\log n)$时间算法或基于LP的算法的组合。LP算法可以扩展到$\RR^d$中任意半径的不相交球,任何(固定)维度$d$,同时保留平面算法的特征。该算法引入了一种新的技术,它结合了线性规划和预测近似欧几里德距离。以前的最佳近似比率分散在不相交的磁盘,即使当所有磁盘具有相同的半径,是$1/2$。我们的研究结果给出了一个开放的问题Cabello,谁问的比例$1/2$是否可以提高部分答案。
英文摘要:
We present three new approximation algorithms with improved constant ratios for selecting $n$ points in $n$ disks such that the minimum pairwise distance among the points is maximized. (1) A very simple $O(n\log n)$-time algorithm with ratio $0.511$ for disjoint unit disks. (2) An LP-based algorithm with ratio $0.707$ for disjoint disks of arbitrary radii that uses a linear number of variables and constraints, and runs in polynomial time. (3) A hybrid algorithm with ratio either $0.4487$ or $0.4674$ for (not necessarily disjoint) unit disks that uses an algorithm of Cabello in combination with either the simple $O(n\log n)$-time algorithm or the LP-based algorithm. The LP algorithm can be extended for disjoint balls of arbitrary radii in $\RR^d$, for any (fixed) dimension $d$, while preserving the features of the planar algorithm. The algorithm introduces a novel technique which combines linear programming and projections for approximating Euclidean distances. The previous best approximation ratio for dispersion in disjoint disks, even when all disks have the same radius, was $1/2$. Our results give a partial answer to an open question raised by Cabello, who asked whether the ratio $1/2$ could be improved.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。