eng
Schloss Dagstuhl – Leibniz-Zentrum für Informatik
Leibniz International Proceedings in Informatics
1868-8969
2022-03-09
13:1
13:15
10.4230/LIPIcs.STACS.2022.13
article
A 10-Approximation of the π/2-MST
Biniaz, Ahmad
1
Daliri, Majid
2
Moradpour, Amir Hossein
2
School of Computer Science, University of Windsor, Canada
School of Electrical and Computer Engineering, University of Tehran, Iran
Bounded-angle spanning trees of points in the plane have received considerable attention in the context of wireless networks with directional antennas. For a point set P in the plane and an angle α, an α-spanning tree (α-ST) is a spanning tree of the complete Euclidean graph on P with the property that all edges incident to each point p ∈ P lie in a wedge of angle α centered at p. The α-minimum spanning tree (α-MST) problem asks for an α-ST of minimum total edge length. The seminal work of Anscher and Katz (ICALP 2014) shows the NP-hardness of the α-MST problem for α = 2π/3, π and presents approximation algorithms for α = π/2, 2π/3, π.
In this paper we study the α-MST problem for α = π/2 which is also known to be NP-hard. We present a 10-approximation algorithm for this problem. This improves the previous best known approximation ratio of 16.
https://drops.dagstuhl.de/storage/00lipics/lipics-vol219-stacs2022/LIPIcs.STACS.2022.13/LIPIcs.STACS.2022.13.pdf
Euclidean spanning trees
approximation algorithms
bounded-angle visibility