直径的快速逼近及随机算法
Fast Approximation and Randomized Algorithms for Diameter
摘要:
我们考虑$S$维中$n$点的集合$S$的直径的逼近。E $\tilde{g}$ ecio $\tilde{g}$ lu和Kalantari \cite{kal}已经表明,给定任何$p \in S$,通过计算它在$S$中的最远点,比如$q$,然后计算$q$的最远点,比如$q'$,我们有${\rm diam}(S) \leq \sqrt{3} d(q,q')$。此外,在最多$t \leq n$附加迭代中,用线段$pq$上的适当选择的点迭代地替换$p$,常数边界因子被改进为$c_*=\sqrt{5-2\sqrt{3}} \approx 1.24$。在这里,我们证明当$m=2$,$t=1$。这表明在实践中,几次迭代可能会在任何维度上产生良好的解决方案。在这里,我们还提出了一个随机化的版本,并提出了大规模的计算结果与这些算法的任意$m$。该算法优于许多现有的算法。在大到$1,000,000$点的数据集上,所提出的算法在$10^{-4}$的绝对误差内计算解决方案。
英文摘要:
We consider approximation of diameter of a set $S$ of $n$ points in dimension $m$. E$\tilde{g}$ecio$\tilde{g}$lu and Kalantari \cite{kal} have shown that given any $p \in S$, by computing its farthest in $S$, say $q$, and in turn the farthest point of $q$, say $q'$, we have ${\rm diam}(S) \leq \sqrt{3} d(q,q')$. Furthermore, iteratively replacing $p$ with an appropriately selected point on the line segment $pq$, in at most $t \leq n$ additional iterations, the constant bound factor is improved to $c_*=\sqrt{5-2\sqrt{3}} \approx 1.24$. Here we prove when $m=2$, $t=1$. This suggests in practice a few iterations may produce good solutions in any dimension. Here we also propose a randomized version and present large scale computational results with these algorithm for arbitrary $m$. The algorithms outperform many existing algorithms. On sets of data as large as $1,000,000$ points, the proposed algorithms compute solutions to within an absolute error of $10^{-4}$.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。