Euclidean Steiner shallow-light trees

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

Abstract

A spanning tree that simultaneously approximates a shortestpath tree and a minimum spanning tree is called a shallow- light tree (shortly, SLT). More specifically, an (α, β)-SLT of a weighted undirected graph G = (V,E,w) with respect to a designated vertex rt ∈ V is a spanning tree of G with: (1) root-stretch α - it preserves all distances between rt and the other vertices up to a factor of α. (2) lightness β - it has weight at most β times the weight of a minimum spanning tree MST(G) of G. Tight tradeoffs between the parameters of SLTs were established by Awerbuch et al. in PODC'90 and by Khuller et al. in SODA'93. They showed that for any ∈ > 0, any graph admits a (1 + ∈,O(1/∈ ))-SLT with respect to any root vertex, and complemented this result with a matching lower bound. Khuller et al. asked if the upper bound β = O(1/∈ ) on the lightness of SLTs can be improved in constant-dimensional Euclidean spaces. In FOCS'11 Elkin and this author gave a negative answer to this question, showing a lower bound of β = Ω(1/∈ ) that applies to 2-dimensional Euclidean spaces. In this paper we show that Steiner points lead to a quadratic improvement in Euclidean SLTs, by presenting a construction of Euclidean Steiner (1 + ∈,O(√ 1/∈ ))-SLTs. While the lightness bound β = O(√ 1/∈ ) of our construction applies to Euclidean spaces of any constant dimension, there is a matching lower bound of β = Ω(√ 1/∈ ) even in 2-dimensional Euclidean spaces. The runtime of our construction, and thus the number of Steiner points used, are bounded by O(n).

Original languageEnglish
Title of host publicationProceedings of the 30th Annual Symposium on Computational Geometry, SoCG 2014
Pages454-463
Number of pages10
DOIs
StatePublished - 2014
Externally publishedYes
Event30th Annual Symposium on Computational Geometry, SoCG 2014 - Kyoto, Japan
Duration: 8 Jun 201411 Jun 2014

Publication series

NameProceedings of the Annual Symposium on Computational Geometry

Conference

Conference30th Annual Symposium on Computational Geometry, SoCG 2014
Country/TerritoryJapan
CityKyoto
Period8/06/1411/06/14

Keywords

  • Euclidean trees
  • Shallow-light trees
  • Steiner points

All Science Journal Classification (ASJC) codes

  • Theoretical Computer Science
  • Geometry and Topology
  • Computational Mathematics

Fingerprint

Dive into the research topics of 'Euclidean Steiner shallow-light trees'. Together they form a unique fingerprint.

Cite this