度量空间的$(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.
University of Massachusetts Amherst(马萨诸塞大学阿默斯特分校);Tel Aviv University(特拉维夫大学);California State University Northridge(北岭加州州立大学);Tufts University(塔夫茨大学);Nanjing University(南京大学)
A Sublinear Approximation Algorithm for Minimum Dilation Trees in the Plane
IT University of Copenhagen(哥本哈根信息技术大学);University of Copenhagen(哥本哈根大学);TU Braunschweig(布伦瑞克工业大学);Université Côte d’Azur(蔚蓝海岸大学);CNRS(法国国家科学研究中心);Inria(法国国家信息与自动化研究所)
A Surprisingly Simple Method for Distributed Euclidean-Minimum Spanning Tree / Single Linkage Dendrogram Construction from High Dimensional Embeddings via Distance Decomposition
Expected Length of the Euclidean Minimum Spanning Tree and 1-norms of Chromatic Persistence Diagrams in the Plane
INRIA(法国国家信息与自动化研究所);ISTA (Institute of Science and Technology Austria)(奥地利科学技术研究院);University of Vienna(维也纳大学);Max Planck Institute of Biochemistry(马克斯·普朗克生物化学研究所)
How Close is a Tree to a Euclidean Minimum Spanning Tree?
Charles University(查理大学);Jagiellonian University(雅盖隆大学);Warsaw University of Technology(华沙理工大学);Università degli Studi di Perugia(佩鲁贾大学);TU Wien(维也纳工业大学)
Lunar Generalizations of the Euclidean Minimum Spanning Tree in the Plane and their Expected Costs
INRIA(法国国家信息与自动化研究所);ISTA (Institute of Science and Technology Austria)(奥地利科学与技术研究所);Max Planck Institute of Biochemistry(马克斯·普朗克生物化学研究所);University of Vienna(维也纳大学);Technical University of Wien(维也纳工业大学)
University of Massachusetts Amherst(马萨诸塞大学阿默斯特分校);Tel Aviv University(特拉维夫大学);California State University Northridge(北岭加州州立大学);Tufts University(塔夫茨大学);State Key Laboratory for Novel Software Technology, Nanjing University(南京大学软件新技术国家重点实验室)