New Doubling Spanners: Better and Simpler

In a seminal STOC'95 paper, Arya et al. conjectured that spanners for low-dimensional Euclidean spaces with constant maximum degree, hop-diameter O(logn) and lightness O(logn) (i.e., weight $O(\log n) \cdot w(\textsf{MST}))$ can be constructed in O(n logn) time. This conjecture, which became a central open question in this area, was resolved in the affirmative by Elkin and Solomon in STOC'13 (even for doubling metrics). In this work we present a simpler construction of spanners for doubling metrics with the above guarantees. Moreover, our construction extends in a simple and natural way to provide k-fault tolerant spanners with maximum degree O(k2), hop-diameter O(logn) and lightness O(k2 logn).

[1]  Michael Elkin,et al.  Shallow-Low-Light Trees, and Tight Lower Bounds for Euclidean Spanners , 2008, FOCS.

[2]  Anupam Gupta,et al.  Small Hop-diameter Sparse Spanners for Doubling Metrics , 2006, SODA '06.

[3]  Shay Solomon Fault-Tolerant Spanners for Doubling Metrics: Better and Simpler , 2012, ArXiv.

[4]  Shay Solomon From hierarchical partitions to hierarchical covers: optimal fault-tolerant spanners for doubling metrics , 2014, STOC.

[5]  Li Ning,et al.  Incubators vs Zombies: Fault-Tolerant, Short, Thin and Lanky Spanners for Doubling Metrics , 2012, ArXiv.

[6]  Michiel H. M. Smid,et al.  Euclidean spanners: short, thin, and lanky , 1995, STOC '95.

[7]  Leonidas J. Guibas,et al.  Deformable spanners and applications. , 2006, Computational geometry : theory and applications.

[8]  Michael Elkin,et al.  Balancing Degree, Diameter, and Weight in Euclidean Spanners , 2011, SIAM J. Discret. Math..

[9]  Li Ning,et al.  Sparse Fault-Tolerant Spanners for Doubling Metrics with Bounded Hop-Diameter or Degree , 2012, ICALP.

[10]  Michael Elkin,et al.  Optimal euclidean spanners: really short, thin and lanky , 2012, STOC '13.

[11]  Bruce M. Maggs,et al.  On hierarchical routing in doubling metrics , 2005, SODA '05.

[12]  Lee-Ad Gottlieb,et al.  Improved algorithms for fully dynamic geometric spanners and geometric routing , 2008, SODA '08.

[13]  Robert Krauthgamer,et al.  Bounded geometries, fractals, and low-distortion embeddings , 2003, 44th Annual IEEE Symposium on Foundations of Computer Science, 2003. Proceedings..

[14]  Paul Chew,et al.  There is a planar graph almost as good as the complete graph , 1986, SCG '86.

[15]  Lee-Ad Gottlieb,et al.  An Optimal Dynamic Spanner for Doubling Metric Spaces , 2008, ESA.

[16]  Liam Roditty Fully Dynamic Geometric Spanners , 2007, SCG '07.