arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 2101.00445cs.CG
收藏

长平面树

Long Plane Trees

Sergio Cabello, Michael Hoffmann, Katharina Klost, Wolfgang Mulzer, Josef Tkadlec

AI总结:

本文研究最长平面生成树问题中近似保证与树直径的关系,提出直径至多四且边长为0.546·OPT的多项式构造算法,证明直径至多三的最长平面树可在多项式时间内找到,并给出任意直径d≥3下的近似因子理论上界。

摘要:

在最长平面生成树问题中,给定一个有限平面点集 $\mathcal{P}$,任务是找到 $\mathcal{P}$ 的一棵平面(即无交叉)生成树,使其欧氏边总长度最大。尽管已有二十多年的研究,该问题是否为 NP 难仍然悬而未决。因此,以往的工作集中于能在多项式时间内生成平面树的算法,这些树的总边长度近似于 $\text{OPT}$,即最大可能长度。这些算法中的近似树都具有较小的无权直径,通常为三或四。自然要问,这是最长平面生成树的共同特征,还是特定近似算法的人为产物。我们提供三个结果来阐明近似保证与近似树无权直径之间的相互作用。首先,我们描述了一种多项式时间算法,用于构造直径至多为四且总边长度至少为 $0.546 \cdot \text{OPT}$ 的平面树。这相对于现有技术水平构成了实质性改进。其次,我们证明在直径至多为三的平面树中,可以在多项式时间内找到一棵最长平面树。第三,对于任意候选直径 $d \geq 3$,我们给出了直径至多为 $d$ 的最长平面树(与无约束的最长平面树相比)所能达到的近似因子的上界。

英文摘要:

In the longest plane spanning tree problem, we are given a finite planar point set $\mathcal{P}$, and our task is to find a plane (i.e., noncrossing) spanning tree for $\mathcal{P}$ with maximum total Euclidean edge length. Despite more than two decades of research, it remains open whether this problem is NP-hard. Thus, previous efforts have focused on olynomial-time algorithms that produce plane trees whose total edge length approximates $\text{OPT}$, the maximum possible length. The approximate trees in these algorithms all have small unweighted diameter, typically three or four. It is natural to ask whether this is a common feature of longest plane spanning trees, or an artifact of the specific approximation algorithms. We provide three results to elucidate the interplay between the approximation guarantee and the unweighted diameter of the approximate trees. First, we describe a polynomial-time algorithm to construct a plane tree with diameter at most four and total edge length at least $0.546 \cdot \text{OPT}$. This constitutes a substantial improvement over the state of the art. Second, we show that a longest plane tree among those with diameter at most three can be found in polynomial time. Third, for any candidate diameter $d \geq 3$, we provide upper bounds on the approximation factor that can be achieved by a longest plane tree with diameter at most $d$ (compared to a longest plane tree without constraints).

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

↑