A Hierarchy of Lower Bounds for Sublinear Additive Spanners

  title={A Hierarchy of Lower Bounds for Sublinear Additive Spanners},
  author={Amir Abboud and Gregory Bodwin and Seth Pettie},
Spanners, emulators, and approximate distance oracles can be viewed as lossy compression schemes that represent an unweighted graph metric in small space, say Õ(n) bits. There is an inherent tradeoff between the sparsity parameter δ and the stretch function f of the compression scheme, but the qualitative nature of this tradeoff has remained a persistent open problem. It has been known for some time that when δ ≥ 1/3 there are schemes with constant additive stretch (distance d is stretched to… CONTINUE READING
Recent Discussions
This paper has been referenced on Twitter 5 times over the past 90 days. VIEW TWEETS
10 Citations
64 References
Similar Papers


Publications referenced by this paper.
Showing 1-10 of 64 references

Sparse subgraphs that preserve long distances and additive spanners

  • B. Bollobás, D. Coppersmith, M. Elkin
  • SIAM J. Discr. Math., 9(4):1029–1055
  • 2006
Highly Influential
15 Excerpts

1 +

  • M. Elkin, D. Peleg
  • β)-spanner constructions for general graphs. SIAM…
  • 2004
Highly Influential
14 Excerpts

Similar Papers

Loading similar papers…