Fetching the paper…
Reading the bibliography…
A $t$-{\em spanner} $H$ of a weighted graph $G=(V,E,w)$ is a subgraph that approximates all pairwise distances up to a factor of $t$.
Priority based overlay multicast with filtering mechanism for distributed interactive applications
J. Yu, L. Chen, and G. Chen · 1905
Earlier work this paper cites.
Plongements lipschitziens dans ℝ n \mathbb{R}^{n}
P. Assouad · 1983
Earlier work this paper cites.
Complexity of network synchronization
B. Awerbuch · 1985
Earlier work this paper cites.
A simple parallel algorithm for the maximal independent set problem
M. Luby · 1986
Earlier work this paper cites.
Network decomposition and locality in distributed computation
B. Awerbuch, A. V. Goldberg, M. Luby, and S. A. Plotkin · 1989
Earlier work this paper cites.
Graph spanners
D. Peleg and A. A. Schäffer · 1989
Earlier work this paper cites.
An optimal synchronizer for the hypercube
D. Peleg and J. D. Ullman · 1989
Earlier work this paper cites.
Cost-sensitive analysis of communication protocols
B. Awerbuch, A. E. Baratz, and D. Peleg · 1990
Earlier work this paper cites.
Efficient broadcast and light-weight spanners
B. Awerbuch, A. E. Baratz, and D. Peleg · 1992
Earlier work this paper cites.
On sparse spanners of weighted graphs
I. Althöfer, G. Das, D. P. Dobkin, D. Joseph, and J. Soares · 1993
Earlier work this paper cites.
Optimally sparse spanners in 3-dimensional euclidean space
G. Das, P. J. Heffernan, and G. Narasimhan · 1993
Earlier work this paper cites.
New sparseness results on graph spanners
B. Chandra, G. Das, G. Narasimhan, and J. Soares · 1995
Earlier work this paper cites.
Balancing minimum spanning trees and shortest-path trees
S. Khuller, B. Raghavachari, and N. E. Young · 1995
Earlier work this paper cites.
Size-estimation framework with applications to transitive closure and reachability
E. Cohen · 1997
Earlier work this paper cites.
Fast algorithms for constructing t-spanners and paths with stretch t
E. Cohen · 1998
Earlier work this paper cites.
Fast distributed construction of small k -dominating sets and applications
S. Kutten and D. Peleg · 1998
Earlier work this paper cites.
An approximation algorithm for minimum-cost network design
Y. Mansour and D. Peleg · 1998
Earlier work this paper cites.
Fast estimation of diameter and shortest paths (without matrix multiplication)
D. Aingworth, C. Chekuri, P. Indyk, and R. Motwani · 1999
Earlier work this paper cites.
Distributed Computing: A Locality-Sensitive Approach
D. Peleg · 2000
Earlier work this paper cites.
A global geometric framework for nonlinear dimensionality reduction
J. B. Tenenbaum, V. d. Silva, and J. C. Langford · 2000
Earlier work this paper cites.
(1+epsilon, beta)-spanner constructions for general graphs
M. Elkin and D. Peleg · 2001
Earlier work this paper cites.
Approximating the single-sink link-installation problem in network design
F. S. Salman, J. Cheriyan, R. Ravi, and S. Subramanian · 2001
Earlier work this paper cites.
Predicting internet network distance with coordinates-based approaches
T. S. E. Ng and H. Zhang · 2002
Cited alongside, same era.
Light graphs with small routing cost
B. Y. Wu, K.-M. Chao, and C. Y. Tang · 2002
Cited alongside, same era.
Bounded geometries, fractals, and low-distortion embeddings
A. Gupta, R. Krauthgamer, and J. R. Lee · 2003
Cited alongside, same era.
SPLAST: a novel approach for multicasting in mobile wireless ad hoc networks
Y. Ben-Shimol, A. Dvir, and M. Segal · 2004
Cited alongside, same era.
Unconditional lower bounds on the time-approximation tradeoffs for the distributed minimum spanning tree problem
M. Elkin · 2004
Cited alongside, same era.
Energy-efficient broadcasting in ad-hoc networks: combining msts with shortest-path trees
P. Penna and C. Ventre · 2004
Light spanners
M. Elkin, O. Neiman, and S. Solomon · 2015
Later among the works it cites.
A light metric spanner
L. Gottlieb · 2015
Later among the works it cites.
Improved parallel algorithms for spanners and hopsets
G. L. Miller, R. Peng, A. Vladu, and S. C. Xu · 2015
Later among the works it cites.
The 4/3 additive spanner exponent is tight
A. Abboud and G. Bodwin · 2016
Later among the works it cites.
On notions of distortion and an almost minimum spanning tree with constant average distortion
Y. Bartal, A. Filtser, and O. Neiman · 2016
Later among the works it cites.
Hopsets with constant hopbound, and applications to approximate shortest paths
M. Elkin and O. Neiman · 2016
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Cited alongside, same era.
A linear-time approximation scheme for planar weighted TSP
P. N. Klein · 2005
Cited alongside, same era.
Distributed spanner construction in doubling metric spaces
M. Damian, S. Pandit, and S. Pemmaraju · 2006
Cited alongside, same era.
Efficient algorithms for constructing (1+epsilon, beta)-spanners in the distributed and streaming models
M. Elkin and J. Zhang · 2006
Cited alongside, same era.
Fast construction of nets in low-dimensional metrics and their applications
S. Har-Peled and M. Mendel · 2006
Cited alongside, same era.
Spanners and emulators with sublinear distance errors
M. Thorup and U. Zwick · 2006
Cited alongside, same era.
A simple and linear time randomized algorithm for computing sparse spanners in weighted graphs
S. Baswana and S. Sen · 2007
Cited alongside, same era.
Fast constructions of lightweight spanners for general graphs
M. Elkin and S. Solomon · 2016
Later among the works it cites.
Parallel metric tree embedding based on an algebraic view on moore-bellman-ford
S. Friedrichs and C. Lenzen · 2016
Later among the works it cites.
The greedy spanner is existentially optimal
A. Filtser and S. Solomon · 2016
Later among the works it cites.
An improved distributed algorithm for maximal independent set
M. Ghaffari · 2016
Later among the works it cites.
Constructing light spanners deterministically in near-linear time
S. Alstrup, S. Dahlgaard, A. Filtser, M. Stöckel, and C. Wulff-Nilsen · 2017
Later among the works it cites.
Near-optimal approximate shortest paths and transshipment in distributed and streaming models
R. Becker, A. Karrenbauer, S. Krinninger, and C. Lenzen · 2017
Later among the works it cites.
Minor-free graphs have light spanners
G. Borradaile, H. Le, and C. Wulff-Nilsen · 2017
Later among the works it cites.
Distributed exact shortest paths in sublinear time
M. Elkin · 2017
Later among the works it cites.
A simple deterministic distributed MST algorithm, with near-optimal time and message complexities
M. Elkin · 2017
Later among the works it cites.
Efficient algorithms for constructing very sparse spanners and emulators
M. Elkin and O. Neiman · 2017
Later among the works it cites.
Efficient algorithms for constructing very sparse spanners and emulators
M. Elkin and O. Neiman · 2017
Later among the works it cites.
Near-optimal light spanners
S. Chechik and C. Wulff-Nilsen · 2018
Later among the works it cites.
Near-optimal distributed routing with low memory
M. Elkin and O. Neiman · 2018
Later among the works it cites.
Light spanners for high dimensional norms via stochastic decompositions
A. Filtser and O. Neiman · 2018
Later among the works it cites.
Improved distributed algorithms for exact shortest paths
M. Ghaffari and J. Li · 2018
Later among the works it cites.
Greedy spanners are optimal in doubling metrics
G. Borradaile, H. Le, and C. Wulff-Nilsen · 2019
Closest in time.