New doubling spanners: Better and simpler

T. H.Hubert Chan, Mingfei Li, Li Ning, Shay Solomon

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

Abstract

In a seminal STOC'95 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)·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'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(log n) and lightness O(k2 log n).

Original languageEnglish
Title of host publicationAutomata, Languages, and Programming - 40th International Colloquium, ICALP 2013, Proceedings
Pages315-327
Number of pages13
EditionPART 1
DOIs
StatePublished - 2013
Externally publishedYes
Event40th International Colloquium on Automata, Languages, and Programming, ICALP 2013 - Riga, Latvia
Duration: 8 Jul 201312 Jul 2013

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
NumberPART 1
Volume7965 LNCS

Conference

Conference40th International Colloquium on Automata, Languages, and Programming, ICALP 2013
Country/TerritoryLatvia
CityRiga
Period8/07/1312/07/13

All Science Journal Classification (ASJC) codes

  • Theoretical Computer Science
  • General Computer Science

Fingerprint

Dive into the research topics of 'New doubling spanners: Better and simpler'. Together they form a unique fingerprint.

Cite this