Sparse distance preservers and additive spanners

Béla Bollobás, Don Coppersmith, Michael Elkin

Research output: Contribution to conferencePaperpeer-review

30 Scopus citations


A notion of distance preserving approach, briefly, a preserver, is introduced. It is shown that any graph has a subgraph D-preserver with at most O(n2/D) edges, and there are graphs and diagraphs for which any undirected Steiner D-preserver contains Ω(n2/D) edges. However, it is illustrated that if one allows a directed Steiner D-preserver, then these bounds can be improved.

Original languageEnglish
Number of pages10
StatePublished - 1 Jan 2003
Externally publishedYes
EventConfiguralble Computing: Technology and Applications - Boston, MA, United States
Duration: 2 Nov 19983 Nov 1998


ConferenceConfiguralble Computing: Technology and Applications
Country/TerritoryUnited States
CityBoston, MA

ASJC Scopus subject areas

  • Software
  • Mathematics (all)


Dive into the research topics of 'Sparse distance preservers and additive spanners'. Together they form a unique fingerprint.

Cite this