文章基本信息

标题：Packing Short Plane Spanning Trees in Complete Geometric Graphs
本地全文：下载
作者：Oswin Aichholzer ; Thomas Hackl ; Matias Korman 等
期刊名称：LIPIcs : Leibniz International Proceedings in Informatics
电子版ISSN：1868-8969
出版年度：2016
卷号：64
页码：9:1-9:12
DOI：10.4230/LIPIcs.ISAAC.2016.9
出版社：Schloss Dagstuhl -- Leibniz-Zentrum fuer Informatik
摘要：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.
关键词：Geometric Graphs; Graph Packing; Plane Graphs; Minimum Spanning Tree; Bottleneck Edge