New Doubling Spanners: Better and Simpler
Authors:
- T.-H. Hubert ChanTCT.-H. Hubert Chan
- Mingfei LiMLMingfei Li
- Li NingLNLi Ning
- Shay SolomonSSShay Solomon
Open Access
- 1 January 2015
- journal article
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Computing
- Vol. 44 (1) , 37-53
Abstract
In a seminal STOC 1995 paper, Arya et al. conjectured that spanners for low-dimensional Euclidean spaces with constant maximum degree, hop-diameter $O(\log n)$, and lightness $O(\log n)$ (i.e., weight $O(\log n) \cdot w({MST}))$ can be constructed in $O(n \log n)$ time. This conjecture, which became a central open question in this area, was resolved in the affirmative by Elkin and Solomon in STOC 2013. In fact, Elkin and Solomon proved that the conjecture of Arya et al. holds even in doubling metrics. However, Elkin and Solomon's spanner construction is complicated. In this work we present a significantly simpler construction of spanners for doubling metrics with the same guarantees as above. Our construction is based on the basic net-tree spanner framework. However, by employing well-known properties of the net-tree spanner in conjunction with numerous new ideas, we managed to get significantly stronger results. First and foremost, our construction extends in a simple and natural way to provide $k$-fault tolerant spanners with maximum degree $O(k^2)$, hop-diameter $O(\log n)$, and lightness $O(k^2 \log n)$. This is the first construction of fault-tolerant spanners (even for Euclidean metrics) that achieves good bounds (polylogarithmic in $n$ and polynomial in $k$) on all the involved parameters simultaneously. Second, we show that the lightness bound of our construction can be improved to $O(k^2)$ (with high probability), for random points in $[0,1]^D$, where $2 \le D = O(1)$.
Keywords
This publication has 12 references indexed in Scilit:
- Distribution-Sensitive Construction of the Greedy Spanner2014
- Sparse Fault-Tolerant Spanners for Doubling Metrics with Bounded Hop-Diameter or DegreeLecture Notes in Computer Science, 2012
- Small Hop-diameter Sparse Spanners for Doubling MetricsDiscrete & Computational Geometry, 2008
- Searching dynamic point sets in spaces with bounded doubling dimension2006
- Fault-Tolerant Geometric SpannersDiscrete & Computational Geometry, 2004
- Nearest Neighbor Queries in Metric SpacesDiscrete & Computational Geometry, 1999
- Fast Algorithms for Constructing t-Spanners and Paths with Stretch tSIAM Journal on Computing, 1998
- Approximating the complete Euclidean graph1988
- There is a planar graph almost as good as the complete graph1986
- Plongements lipschitziens dans ${\bbfR}\sp n$Bulletin de la Société Mathématiques de France, 1983