2026-07-22T08:26:26Z https://drops.dagstuhl.de/oai

oai:drops-oai.dagstuhl.de:16031 2024-03-06T10:56:47Z ddc:004 open_access

Long Plane Trees Cabello, Sergio Hoffmann, Michael Klost, Katharina Mulzer, Wolfgang Tkadlec, Josef geometric network design spanning trees plane straight-line graphs approximation algorithms In the longest plane spanning tree problem, we are given a finite planar point set 𝒫, and our task is to find a plane (i.e., noncrossing) spanning tree T_OPT for 𝒫 with maximum total Euclidean edge length |T_OPT|. Despite more than two decades of research, it remains open if this problem is NP-hard. Thus, previous efforts have focused on polynomial-time algorithms that produce plane trees whose total edge length approximates |T_OPT|. 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 T_ALG with diameter at most four and |T_ALG| ≥ 0.546 ⋅ |T_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 ≥ 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). Schloss Dagstuhl – Leibniz-Zentrum für Informatik Sergio Cabello and Michael Hoffmann and Katharina Klost and Wolfgang Mulzer and Josef Tkadlec 2022 Is Part Of LIPIcs, Volume 224, 38th International Symposium on Computational Geometry (SoCG 2022) InProceedings Text doc-type:ResearchArticle publishedVersion application/pdf doi:10.4230/LIPIcs.SoCG.2022.23 urn:nbn:de:0030-drops-160311 https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2022.23 eng https://creativecommons.org/licenses/by/4.0/legalcode