Packing Short Plane Spanning Graphs in Complete Geometric Graphs
Abstract
Given a set of points in the plane, we want to establish a connection network between these points that consists of several disjoint layers. Motivated by sensor networks, we want that each layer is spanning and plane, and that no edge is very long (when compared to the minimum length needed to obtain a spanning graph). We consider two different approaches: first we show an almost optimal centralized approach to extract two graphs. Then we show a constant factor approximation for a distributed model in which each point can compute its adjacencies using only local information. In both cases the obtained layers are plane
Cite
@article{arxiv.1703.05863,
title = {Packing Short Plane Spanning Graphs in Complete Geometric Graphs},
author = {Oswin Aichholzer and Thomas Hackl and Matias Korman and Alexander Pilz and Günter Rote and André van Renssen and Marcel Roeloffzen and Birgit Vogtenhuber},
journal= {arXiv preprint arXiv:1703.05863},
year = {2019}
}
Comments
Preliminary version appeared in the proceedings of the 27th International Symposium on Algorithms and Computation (ISAAC 2016), Leibniz International Proceedings in Informatics (LIPIcs), Vol. 64, pp. 9:1-9:12