Fault tolerant additive and (μ, α)-spanners

Gilad Braunschvig, Shiri Chechik, David Peleg*, Adam Sealfon

*Corresponding author for this work

Research output: Contribution to journalArticlepeer-review


Graph spanners are sparse subgraphs that preserve the distances of the original graph up to some approximation ratio (the spanner's stretch). A number of algorithms are known for constructing sparse spanners with small multiplicative or additive stretch. Recently, algorithms were introduced for constructing fault-tolerant multiplicative spanners of general graphs. This paper addresses the analogous problem of constructing fault tolerant additive and (μ, α)-spanners for general graphs, and presents a number of (deterministic and randomized) construction algorithms for such spanners.

Original languageEnglish
Pages (from-to)94-100
Number of pages7
JournalTheoretical Computer Science
StatePublished - 17 May 2015


  • Additive spanners
  • Fault tolerance
  • Graph algorithms
  • Spanners


Dive into the research topics of 'Fault tolerant additive and (μ, α)-spanners'. Together they form a unique fingerprint.

Cite this