Fetching the paper…
Reading the bibliography…
A \emph{spanner} of a graph $G$ is a subgraph $H$ that approximately preserves shortest path distances in $G$.
Graph spanners
David Peleg and Alejandro A. Schäffer · 1989
Earlier work this paper cites.
A trade-off between space and efficiency for routing tables
David Peleg and Eli Upfal · 1989
Earlier work this paper cites.
Generating sparse spanners for weighted graphs
Ingo Althöfer, Gautam Das, David Dobkin, and Deborah Joseph · 1990
Earlier work this paper cites.
Additive graph spanners
Arthur Liestman and Thomas Shermer · 1993
Earlier work this paper cites.
Computing visibility information in an inaccurate simple polygon
Leizhen Cai and J. Mark Keil · 1997
Earlier work this paper cites.
Fast estimation of diameter and shortest paths (without matrix multiplication)
Donald Aingworth, Chandra Chekuri, Piotr Indyk, and Rajeev Motwani · 1999
Earlier work this paper cites.
( 1 + ϵ , β ) (1+\epsilon,\beta) -spanner constructions for general graphs
Michael Elkin and David Peleg · 2004
Earlier work this paper cites.
Computing almost shortest paths
Michael Elkin · 2005
Earlier work this paper cites.
Sparse sourcewise and pairwise distance preservers
Don Coppersmith and Michael Elkin · 2006
Earlier work this paper cites.
Spanners and emulators with sublinear distance errors
Mikkel Thorup and Uri Zwick · 2006
Earlier work this paper cites.
Geometric Spanner Networks
Giri Narasimhan and Michiel Smid · 2007
Cited alongside, same era.
Low distortion spanners
Seth Pettie · 2009
Cited alongside, same era.
Additive spanners and ( α \alpha , β \beta )-spanners
Surender Baswana, Telikepalli Kavitha, Kurt Mehlhorn, and Seth Pettie · 2010
Cited alongside, same era.
Additive spanners in nearly quadratic time
David P Woodruff · 2010
Cited alongside, same era.
New additive spanners
Shiri Chechik · 2013
Cited alongside, same era.
On pairwise spanners
Marek Cygan, Fabrizio Grandoni, and Telikepalli Kavitha · 2013
Cited alongside, same era.
Small stretch pairwise spanners and approximate d d -preservers
Telikepalli Kavitha and Nithin M. Varma · 2015
Later among the works it cites.
Better distance preservers and additive spanners
Greg Bodwin and Virginia Vassilevska Williams · 2016
Later among the works it cites.
The 4/3 additive spanner exponent is tight
Amir Abboud and Greg Bodwin · 2017
Later among the works it cites.
A hierarchy of lower bounds for sublinear additive spanners
Amir Abboud, Greg Bodwin, and Seth Pettie · 2017
Later among the works it cites.
Linear size distance preservers
Greg Bodwin · 2017
Later among the works it cites.
New pairwise spanners
Telikepalli Kavitha · 2017
Later among the works it cites.
Near-Optimal Distance Emulator for Planar Graphs
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
James D Marble and Kostas E Bekris · 2013
Cited alongside, same era.
Sparse roadmap spanners for asymptotically near-optimal motion planning
Andrew Dobson and Kostas E Bekris · 2014
Cited alongside, same era.
Additive spanners: A simple construction
Mathias Bæk Tejs Knudsen · 2014
Cited alongside, same era.
Sparsification of motion-planning roadmaps by edge contraction
Oren Salzman, Doron Shaharabani, Pankaj K Agarwal, and Dan Halperin · 2014
Cited alongside, same era.
Hsien-Chih Chang, Pawel Gawrychowski, Shay Mozes, and Oren Weimann · 2018
Later among the works it cites.
Lower bounds on sparse spanners, emulators, and diameter-reducing shortcuts
Shang-En Huang and Seth Pettie · 2018
Later among the works it cites.
Almost shortest paths and PRAM distance oracles in weighted graphs
Michael Elkin, Yuval Gitlitz, and Ofer Neiman · 2019
Later among the works it cites.
A note on distance-preserving graph sparsification
Greg Bodwin · 2020
Closest in time.