Fetching the paper…
Reading the bibliography…
Let $G=(V,E,w)$ be a weighted undirected graph with $n$ vertices and $m$ edges, and fix a set of $s$ sources $S\subseteq V$.
Fibonacci heaps and their uses in improved network optimization algorithms
Michael L. Fredman and Robert Endre Tarjan · 1987
Earlier work this paper cites.
Matrix multiplication via arithmetic progressions
Don Coppersmith and Shmuel Winograd · 1990
Earlier work this paper cites.
High-probability parallel transitive-closure algorithms
Jeffrey D. Ullman and Mihalis Yannakakis · 1991
Earlier work this paper cites.
A linear-processor polylog-time algorithm for shortest paths in planar graphs
Philip N. Klein and Sairam Subramanian · 1993
Earlier work this paper cites.
On the exponent of the all pairs shortest path problem
Noga Alon, Zvi Galil, and Oded Margalit · 1997
Earlier work this paper cites.
All pairs shortest distances for graphs with small integer length edges
Zvi Galil and Oded Margalit · 1997
Earlier work this paper cites.
A randomized parallel algorithm for single-source shortest paths
Philip N. Klein and Sairam Subramanian · 1997
Earlier work this paper cites.
Time-work tradeoffs for parallel algorithms
Thomas H. Spencer · 1997
Earlier work this paper cites.
Undirected single source shortest path in linear time
Mikkel Thorup · 1997
Earlier work this paper cites.
Time-work tradeoffs of the single-source shortest paths problem
Hanmao Shi and Thomas H. Spencer · 1999
Earlier work this paper cites.
Polylog-time and near-linear work approximation scheme for undirected shortest paths
Edith Cohen · 2000
Earlier work this paper cites.
All-pairs almost shortest paths
D. Dor, S. Halperin, and U. Zwick · 2000
Earlier work this paper cites.
All-pairs small-stretch paths
Edith Cohen and Uri Zwick · 2001
Earlier work this paper cites.
Computing almost shortest paths
M. Elkin · 2001
Earlier work this paper cites.
Approximate distance oracles
M. Thorup and U. Zwick · 2001
Earlier work this paper cites.
All pairs shortest paths using bridging sets and rectangular matrix multiplication
Uri Zwick · 2002
Cited alongside, same era.
An unconditional lower bound on the time-approximation tradeoff of the minimum spanning tree problem
M. Elkin · 2004
Cited alongside, same era.
(1+epsilon, beta)-spanner constructions for general graphs
Michael Elkin and David Peleg · 2004
Cited alongside, same era.
Sparse source-wise and pair-wise distance preservers
D. Coppersmith and M. Elkin · 2005
Cited alongside, same era.
Faster algorithms for approximate distance oracles and all-pairs small stretch paths
Surender Baswana and Telikepalli Kavitha · 2006
Cited alongside, same era.
Efficient algorithms for constructing (1+epsilon, beta)-spanners in the distributed and streaming models
A linear-size logarithmic stretch path-reporting distance oracle for general graphs
Michael Elkin and Seth Pettie · 2015
Later among the works it cites.
Improved parallel algorithms for spanners and hopsets
Gary L. Miller, Richard Peng, Adrian Vladu, and Shen Chen Xu · 2015
Later among the works it cites.
Parallel metric tree embedding based on an algebraic view on moore-bellman-ford
Stephan Friedrichs and Christoph Lenzen · 2016
Later among the works it cites.
A deterministic almost-tight distributed algorithm for approximating single-source shortest paths
Monika Henzinger, Sebastian Krinninger, and Danupon Nanongkai · 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
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Michael Elkin and Jian Zhang · 2006
Cited alongside, same era.
Spanners and emulators with sublinear distance errors
M. Thorup and U. Zwick · 2006
Cited alongside, same era.
Fully dynamic (2 + epsilon) approximate all-pairs shortest paths with fast query and close to linear update time
Aaron Bernstein · 2009
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.
Distributed algorithms for ultrasparse spanners and linear size skeletons
Seth Pettie · 2010
Cited alongside, same era.
Multiplying matrices faster than coppersmith-winograd
Virginia Vassilevska Williams · 2012
Cited alongside, same era.
Later among the works it cites.
Efficient algorithms for constructing very sparse spanners and emulators
Michael Elkin and Ofer Neiman · 2019
Closest in time.
Hopsets with constant hopbound, and applications to approximate shortest paths
Michael Elkin and Ofer Neiman · 2019
Closest in time.
Linear-size hopsets with small hopbound, and constant-hopbound hopsets in RNC
Michael Elkin and Ofer Neiman · 2019
Closest in time.
Thorup-zwick emulators are universally optimal hopsets
Shang-En Huang and Seth Pettie · 2019
Closest in time.
Weighted additive spanners, 2020
Reyan Ahmed, Greg Bodwin, Faryad Darabi Sahneh, Stephen Kobourov, and Richard Spence · 2020
Closest in time.
Parallel approximate undirected shortest paths via low hop emulators
Alexandr Andoni, Clifford Stein, and Peilin Zhong · 2020
Closest in time.
New ( α \alpha , β \beta ) spanners and hopsets
Uri Ben-Levy and Merav Parter · 2020
Closest in time.
Faster parallel algorithm for approximate shortest path
Jason Li · 2020
Closest in time.
Centralized, parallel, and distributed multi-source shortest paths via hopsets and rectangular matrix multiplication
Michael Elkin and Ofer Neiman · 2022
Closest in time.