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

最优欧几里得树覆盖

Optimal Euclidean Tree Covers

Hsien-Chih Chang, Jonathan Conroy, Hung Le, Lazar Milenkovic, Shay Solomon, Cuong Than

AI总结:

本文针对低维欧几里得空间提出了一种树数量最优且点最大度数为绝对常数的$(1+\varepsilon)$-拉伸树覆盖及Steiner树覆盖,并由此导出最优路由方案,改进了Dumbbell定理的构造与运行时间。

摘要:

度量空间的$(1+\varepsilon)$-拉伸树覆盖是树的集合,其中每对点在其中一棵树中都有$(1+\varepsilon)$-拉伸路径。著名的Dumbbell定理[Arya等人 STOC'95]指出,$d$维欧几里得空间中的任意$n$个点集都存在包含$O_d(\varepsilon^{-d} \cdot \log(1/\varepsilon))$棵树的$(1+\varepsilon)$-拉伸树覆盖,其中$O_d$符号隐藏了仅依赖于维度$d$的项。其构造的运行时间为$O_d(n \log n \cdot \frac{\log(1/\varepsilon)}{\varepsilon^{d}} + n \cdot \varepsilon^{-2d})$。由于同一点可能出现在树的多个层级中,该点在树覆盖中的最大度数可能高达$\Omega(\log \Phi)$,其中$\Phi$是输入点集的纵横比。在本研究中,我们提出了一种包含$O_d(\varepsilon^{-d+1} \cdot \log(1/\varepsilon))$棵树的$(1+\varepsilon)$-拉伸树覆盖,这是最优的(至多相差$\log(1/\varepsilon)$因子)。此外,对于任意$d$,任何树中点的最大度数都是一个绝对常数。作为直接推论,我们在低维欧几里得空间中获得了一种最优路由方案。我们还提出了一种包含$O_d(\varepsilon^{(-d+1)/{2}} \cdot \log(1/\varepsilon))$棵树的$(1+\varepsilon)$-拉伸Steiner树覆盖(允许使用Steiner点),这同样是最优的。我们两种构造的运行时间与各自树覆盖中的边数呈线性关系,忽略加法项$O_d(n \log n)$;这改进了Dumbbell定理背后的运行时间。

英文摘要:

A $(1+\varepsilon)\textit{-stretch tree cover}$ of a metric space is a collection of trees, where every pair of points has a $(1+\varepsilon)$-stretch path in one of the trees. The celebrated $\textit{Dumbbell Theorem}$ [Arya et~al. STOC'95] states that any set of $n$ points in $d$-dimensional Euclidean space admits a $(1+\varepsilon)$-stretch tree cover with $O_d(\varepsilon^{-d} \cdot \log(1/\varepsilon))$ trees, where the $O_d$ notation suppresses terms that depend solely on the dimension~$d$. The running time of their construction is $O_d(n \log n \cdot \frac{\log(1/\varepsilon)}{\varepsilon^{d}} + n \cdot \varepsilon^{-2d})$. Since the same point may occur in multiple levels of the tree, the $\textit{maximum degree}$ of a point in the tree cover may be as large as $Ω(\log Φ)$, where $Φ$ is the aspect ratio of the input point set. In this work we present a $(1+\varepsilon)$-stretch tree cover with $O_d(\varepsilon^{-d+1} \cdot \log(1/\varepsilon))$ trees, which is optimal (up to the $\log(1/\varepsilon)$ factor). Moreover, the maximum degree of points in any tree is an $\textit{absolute constant}$ for any $d$. As a direct corollary, we obtain an optimal {routing scheme} in low-dimensional Euclidean spaces. We also present a $(1+\varepsilon)$-stretch $\textit{Steiner}$ tree cover (that may use Steiner points) with $O_d(\varepsilon^{(-d+1)/{2}} \cdot \log(1/\varepsilon))$ trees, which too is optimal. The running time of our two constructions is linear in the number of edges in the respective tree covers, ignoring an additive $O_d(n \log n)$ term; this improves over the running time underlying the Dumbbell Theorem.

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

↑