Packing Short Plane Spanning Trees in Complete Geometric Graphs

Oswin Aichholzer, Thomas Hackl, Matias Korman, Alexander Pilz, Günter Rote, A. van Renssen, Marcel Roeloffzen, Birgit Vogtenhuber

Research output: Chapter in Book/Report/Conference proceedingConference paperpeer-review


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 trees. Then we show a constant factor approximation for a distributed model in which each point can compute its adjacencies using only local information. This second approach may create cycles, but maintains planarity.
Original languageEnglish
Title of host publicationProceedings of the 27th Internationel Symposium on Algorithms and Computation
Publication statusPublished - 2016
Event27th International Symposium on Algorithms and Computation: ISAAC 2016 - Sydney, Australia
Duration: 12 Dec 201614 Dec 2016


Conference27th International Symposium on Algorithms and Computation
Abbreviated titleISAAC 2016

Fields of Expertise

  • Information, Communication & Computing


Dive into the research topics of 'Packing Short Plane Spanning Trees in Complete Geometric Graphs'. Together they form a unique fingerprint.

Cite this