Fetching the paper…
Reading the bibliography…
This tutorial review provides a guiding reference to researchers who want to have an overview of the large body of literature about graph spanners.
Sur la trialité et certains groupes qui s’en déduisent
Jacques Tits · 1959
Earlier work this paper cites.
Sur la trialité et certains groupes qui s’en déduisent
Jacques Tits · 1959
Earlier work this paper cites.
Extremal problems in graph theory
Paul Erdős · 1963
Earlier work this paper cites.
Extremal problems in graph theory
Paul Erdős · 1963
Earlier work this paper cites.
Some extremal problems in graph theory
P. Erdős and M. Simonovits · 1970
Earlier work this paper cites.
Some extremal problems in graph theory
P. Erdős and M. Simonovits · 1970
Earlier work this paper cites.
Complexity of network synchronization
Baruch Awerbuch · 1985
Earlier work this paper cites.
Complexity of network synchronization
Baruch Awerbuch · 1985
Earlier work this paper cites.
Reconstructing the shape of a tree from observed dissimilarity data
Hans-Jürgen Bandelt and Andreas Dress · 1986
Earlier work this paper cites.
Optimal simulations of tree machines
Sandeep Bhatt, Fan Chung, Tom Leighton, and Arnold Rosenberg · 1986
Earlier work this paper cites.
Reconstructing the shape of a tree from observed dissimilarity data
Hans-Jürgen Bandelt and Andreas Dress · 1986
Earlier work this paper cites.
Optimal simulations of tree machines
Sandeep Bhatt, Fan Chung, Tom Leighton, and Arnold Rosenberg · 1986
Earlier work this paper cites.
There are planar graphs almost as good as the complete graph
L Paul Chew · 1989
Earlier work this paper cites.
Graph spanners
David Peleg and Alejandro A Schäffer · 1989
Earlier work this paper cites.
An optimal synchronizer for the hypercube
David Peleg and Jeffrey D Ullman · 1989
Earlier work this paper cites.
There are planar graphs almost as good as the complete graph
L Paul Chew · 1989
Earlier work this paper cites.
Graph spanners
David Peleg and Alejandro A Schäffer · 1989
Earlier work this paper cites.
An optimal synchronizer for the hypercube
David Peleg and Jeffrey D Ullman · 1989
Earlier work this paper cites.
Extremal graphs with no C 4 C^{4} ’s, C 6 C^{6} ’s, or C 10 C^{10} ’s
R Wenger · 1991
Earlier work this paper cites.
Extremal graphs with no C 4 C^{4} ’s, C 6 C^{6} ’s, or C 10 C^{10} ’s
R Wenger · 1991
Earlier work this paper cites.
Online load balancing in a distributed network
Baruch Awerbuch, Shay Kutten, and David Peleg · 1992
Earlier work this paper cites.
New sparseness results on graph spanners
Barun Chandra, Gautam Das, Giri Narasimhan, and José Soares · 1992
Earlier work this paper cites.
Online load balancing in a distributed network
Baruch Awerbuch, Shay Kutten, and David Peleg · 1992
Earlier work this paper cites.
New sparseness results on graph spanners
Barun Chandra, Gautam Das, Giri Narasimhan, and José Soares · 1992
Earlier work this paper cites.
On sparse spanners of weighted graphs
Ingo Althöfer, Gautam Das, David Dobkin, Deborah Joseph, and José Soares · 1993
Earlier work this paper cites.
Additive graph spanners
Arthur Liestman and Thomas Shermer · 1993
Earlier work this paper cites.
On sparse spanners of weighted graphs
Ingo Althöfer, Gautam Das, David Dobkin, Deborah Joseph, and José Soares · 1993
Earlier work this paper cites.
Additive graph spanners
Arthur Liestman and Thomas Shermer · 1993
Earlier work this paper cites.
NP-completeness of minimum spanner problems
Leizhen Cai · 1994
Earlier work this paper cites.
Generating low-degree 2-spanners
Guy Kortsarz and David Peleg · 1994
Earlier work this paper cites.
Generating sparse 2-spanners
Guy Kortsarz and David Peleg · 1994
Earlier work this paper cites.
NP-completeness of minimum spanner problems
Leizhen Cai · 1994
Earlier work this paper cites.
Generating low-degree 2-spanners
Guy Kortsarz and David Peleg · 1994
Earlier work this paper cites.
Generating sparse 2-spanners
Guy Kortsarz and David Peleg · 1994
Earlier work this paper cites.
Euclidean spanners: short, thin, and lanky
Sunil Arya, Gautam Das, David M Mount, Jeffrey S Salowe, and Michiel Smid · 1995
Earlier work this paper cites.
Tree spanners
Leizhen Cai and Derek G Corneil · 1995
Earlier work this paper cites.
Euclidean spanners: short, thin, and lanky
Sunil Arya, Gautam Das, David M Mount, Jeffrey S Salowe, and Michiel Smid · 1995
Earlier work this paper cites.
Tree spanners
Leizhen Cai and Derek G Corneil · 1995
Earlier work this paper cites.
Hardness of Approximations
Sanjeev Arora and Carsten Lund · 1996
Earlier work this paper cites.
Unpublished result, 1996
S. Halperin and U. Zwick · 1996
Earlier work this paper cites.
Hardness of Approximations
Sanjeev Arora and Carsten Lund · 1996
Earlier work this paper cites.
Unpublished result, 1996
S. Halperin and U. Zwick · 1996
Earlier work this paper cites.
Introduction to linear optimization
Dimitris Bertsimas and John N Tsitsiklis · 1997
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.
Introduction to linear optimization
Dimitris Bertsimas and John N Tsitsiklis · 1997
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.
NP-completeness results for minimum planar spanners
Ulrik Brandes and Dagmar Handke · 1998
Earlier work this paper cites.
A sublinear time distributed algorithm for minimum-weight spanning trees
Juan A Garay, Shay Kutten, and David Peleg · 1998
Earlier work this paper cites.
Efficient algorithms for constructing fault-tolerant geometric spanners
Christos Levcopoulos, Giri Narasimhan, and Michiel Smid · 1998
Earlier work this paper cites.
NP-completeness results for minimum planar spanners
Ulrik Brandes and Dagmar Handke · 1998
Earlier work this paper cites.
A sublinear time distributed algorithm for minimum-weight spanning trees
Juan A Garay, Shay Kutten, and David Peleg · 1998
Earlier work this paper cites.
Efficient algorithms for constructing fault-tolerant geometric spanners
Christos Levcopoulos, Giri Narasimhan, and Michiel Smid · 1998
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.
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.
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
Dorit Dor, Shay Halperin, and Uri Zwick · 2000
Earlier work this paper cites.
Strong inapproximability of the basic k k -spanner problem
Michael Elkin and David Peleg · 2000
Earlier work this paper cites.
Tree spanners for subgraphs and related tree covering problems
Dagmar Handke and Guy Kortsarz · 2000
Earlier work this paper cites.
Distributed Computing: A Locality-Sensitive Approach
D. Peleg · 2000
Earlier work this paper cites.
Distributed computing
David Peleg · 2000
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
Dorit Dor, Shay Halperin, and Uri Zwick · 2000
Earlier work this paper cites.
Strong inapproximability of the basic k k -spanner problem
Michael Elkin and David Peleg · 2000
Earlier work this paper cites.
Tree spanners for subgraphs and related tree covering problems
Dagmar Handke and Guy Kortsarz · 2000
Earlier work this paper cites.
Distributed Computing: A Locality-Sensitive Approach
D. Peleg · 2000
Earlier work this paper cites.
Distributed computing
David Peleg · 2000
Earlier work this paper cites.
Approximate distance oracles
Mikkel Thorup and Uri Zwick · 2001
Earlier work this paper cites.
Compact routing schemes
Mikkel Thorup and Uri Zwick · 2001
Earlier work this paper cites.
Approximate distance oracles
Mikkel Thorup and Uri Zwick · 2001
Earlier work this paper cites.
Compact routing schemes
Mikkel Thorup and Uri Zwick · 2001
Earlier work this paper cites.
Roundtrip spanners and roundtrip routing in directed graphs
Liam Roditty, Mikkel Thorup, and Uri Zwick · 2002
Earlier work this paper cites.
Roundtrip spanners and roundtrip routing in directed graphs
Liam Roditty, Mikkel Thorup, and Uri Zwick · 2002
Earlier work this paper cites.
A simple linear time algorithm for computing a ( 2 k − 1 ) − (2k-1)- spanner of O ( n 1 + 1 / k ) O(n^{1+1/k}) size in weighted graphs
Surender Baswana and Sandeep Sen · 2003
Earlier work this paper cites.
A simple linear time algorithm for computing a ( 2 k − 1 ) − (2k-1)- spanner of O ( n 1 + 1 / k ) O(n^{1+1/k}) size in weighted graphs
Surender Baswana and Sandeep Sen · 2003
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.
Construction of minimum-weight spanners
Mikkel Sigurd and Martin Zachariasen · 2004
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.
Construction of minimum-weight spanners
Mikkel Sigurd and Martin Zachariasen · 2004
Earlier work this paper cites.
New constructions of ( α , β ) (\alpha,\beta) –spanners and purely additive spanners
Surender Baswana, Telikepalli Kavitha, Kurt Mehlhorn, and Seth Pettie · 2005
Earlier work this paper cites.
Sparse distance preservers and additive spanners
Béla Bollobás, Don Coppersmith, and Michael Elkin · 2005
Earlier work this paper cites.
Computing almost shortest paths
Michael Elkin · 2005
Earlier work this paper cites.
Approximating k k –spanner problems for k > 2 k>2
Michael Elkin and David Peleg · 2005
Earlier work this paper cites.
On graph problems in a semi-streaming model
Joan Feigenbaum, Sampath Kannan, Andrew McGregor, Siddharth Suri, and Jian Zhang · 2005
Earlier work this paper cites.
Deterministic constructions of approximate distance oracles and spanners
Liam Roditty, Mikkel Thorup, and Uri Zwick · 2005
Earlier work this paper cites.
Exploring protein folding trajectories using geometric spanners
Daniel Russel and L Guibas · 2005
Earlier work this paper cites.
New constructions of ( α , β ) (\alpha,\beta) –spanners and purely additive spanners
Surender Baswana, Telikepalli Kavitha, Kurt Mehlhorn, and Seth Pettie · 2005
Earlier work this paper cites.
Sparse distance preservers and additive spanners
Béla Bollobás, Don Coppersmith, and Michael Elkin · 2005
Earlier work this paper cites.
Computing almost shortest paths
Michael Elkin · 2005
Earlier work this paper cites.
Approximating k k –spanner problems for k > 2 k>2
Michael Elkin and David Peleg · 2005
Earlier work this paper cites.
On graph problems in a semi-streaming model
Joan Feigenbaum, Sampath Kannan, Andrew McGregor, Siddharth Suri, and Jian Zhang · 2005
Earlier work this paper cites.
Deterministic constructions of approximate distance oracles and spanners
Liam Roditty, Mikkel Thorup, and Uri Zwick · 2005
Earlier work this paper cites.
Exploring protein folding trajectories using geometric spanners
Daniel Russel and L Guibas · 2005
Earlier work this paper cites.
Small stretch spanners on dynamic graphs
Giorgio Ausiello, Paolo Giulio Franciosa, and Giuseppe F. Italiano · 2006
Earlier work this paper cites.
Dynamic algorithms for graph spanners
Surender Baswana · 2006
Earlier work this paper cites.
Approximate distance oracles for unweighted graphs in expected O ( n 2 ) O(n^{2}) time
Surender Baswana and Sandeep Sen · 2006
Earlier work this paper cites.
Spanners with slack
T-H Hubert Chan, Michael Dinitz, and Anupam Gupta · 2006
Earlier work this paper cites.
Sparse sourcewise and pairwise distance preservers
Don Coppersmith and Michael Elkin · 2006
Earlier work this paper cites.
Efficient algorithms for constructing (1+ ε \varepsilon , β \beta )-spanners in the distributed and streaming models
Michael Elkin and Jian Zhang · 2006
Earlier work this paper cites.
A subset spanner for planar graphs, with application to subset tsp
Philip N. Klein · 2006
Earlier work this paper cites.
Spanners and emulators with sublinear distance errors
Mikkel Thorup and Uri Zwick · 2006
Earlier work this paper cites.
Lower bounds for additive spanners, emulators, and more
David P Woodruff · 2006
Earlier work this paper cites.
Small stretch spanners on dynamic graphs
Giorgio Ausiello, Paolo Giulio Franciosa, and Giuseppe F. Italiano · 2006
Earlier work this paper cites.
Dynamic algorithms for graph spanners
Surender Baswana · 2006
Earlier work this paper cites.
Approximate distance oracles for unweighted graphs in expected O ( n 2 ) O(n^{2}) time
Surender Baswana and Sandeep Sen · 2006
Earlier work this paper cites.
Spanners with slack
T-H Hubert Chan, Michael Dinitz, and Anupam Gupta · 2006
Cited alongside, same era.
Sparse sourcewise and pairwise distance preservers
Don Coppersmith and Michael Elkin · 2006
Cited alongside, same era.
Efficient algorithms for constructing (1+ ε \varepsilon , β \beta )-spanners in the distributed and streaming models
Michael Elkin and Jian Zhang · 2006
Cited alongside, same era.
A subset spanner for planar graphs, with application to subset tsp
Philip N. Klein · 2006
Cited alongside, same era.
Spanners and emulators with sublinear distance errors
Mikkel Thorup and Uri Zwick · 2006
Cited alongside, same era.
Lower bounds for additive spanners, emulators, and more
David P Woodruff · 2006
Cited alongside, same era.
The greedy spanner is existentially optimal
Arnold Filtser and Shay Solomon · 2016
Later among the works it cites.
Error amplification for pairwise spanner lower bounds
Amir Abboud and Greg Bodwin · 2016
Later among the works it cites.
On resilient graph spanners
Giorgio Ausiello, Paolo Giulio Franciosa, Giuseppe F. Italiano, and Andrea Ribichini · 2016
Later among the works it cites.
Fully dynamic spanners with worst-case update time
Greg Bodwin and Sebastian Krinninger · 2016
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.
Distributed construction of purely additive spanners
Keren Censor-Hillel, Telikepalli Kavitha, Ami Paz, and Amir Yehudayoff · 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…
A simple and linear time randomized algorithm for computing sparse spanners in weighted graphs
Surender Baswana and Sandeep Sen · 2007
Cited alongside, same era.
Deterministic distributed construction of linear stretch spanners in polylogarithmic time
Bilel Derbel, Cyril Gavoille, and David Peleg · 2007
Cited alongside, same era.
The hardness of approximating spanner problems
Michael Elkin and David Peleg · 2007
Cited alongside, same era.
Geometric Spanner Networks
Giri Narasimhan and Michiel Smid · 2007
Cited alongside, same era.
A simple and linear time randomized algorithm for computing sparse spanners in weighted graphs
Surender Baswana and Sandeep Sen · 2007
Cited alongside, same era.
Deterministic distributed construction of linear stretch spanners in polylogarithmic time
Bilel Derbel, Cyril Gavoille, and David Peleg · 2007
Cited alongside, same era.
Lowest-degree k k -spanner: Approximation and hardness
Eden Chlamtáč and Michael Dinitz · 2016
Later among the works it cites.
Label cover instances with large girth and the hardness of approximating basic k k -spanner
Michael Dinitz, Guy Kortsarz, and Ran Raz · 2016
Later among the works it cites.
Approximating low-stretch spanners
Michael Dinitz and Zeyu Zhang · 2016
Later among the works it cites.
Fast constructions of lightweight spanners for general graphs
Michael Elkin and Shay Solomon · 2016
Later among the works it cites.
The greedy spanner is existentially optimal
Arnold Filtser and Shay Solomon · 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.
Linear size distance preservers
Greg Bodwin · 2017
Later among the works it cites.
Preserving distances in very faulty graphs
Greg Bodwin, Fabrizio Grandoni, Merav Parter, and Virginia Vassilevska Williams · 2017
Later among the works it cites.
Minor-free graphs have light spanners
Glencora Borradaile, Hung Le, and Christian Wulff-Nilsen · 2017
Later among the works it cites.
Approximating spanners and directed Steiner forest: Upper and lower bounds
Eden Chlamtáč, Michael Dinitz, Guy Kortsarz, and Bundit Laekhanukit · 2017
Later among the works it cites.
Terminal embeddings
Michael Elkin, Arnold Filtser, and Ofer Neiman · 2017
Later among the works it cites.
Distance-preserving subgraphs of interval graphs
Kshitij Gajjar and Jaikumar Radhakrishnan · 2017
Later among the works it cites.
Multiple Source Dual Fault Tolerant BFS Trees
Manoj Gupta and Shahbaz Khan · 2017
Later among the works it cites.
New pairwise spanners
Telikepalli Kavitha · 2017
Later among the works it cites.
Additive spanners and distance oracles in quadratic time
Mathias Bæk Tejs Knudsen · 2017
Later among the works it cites.
Vertex fault tolerant additive spanners
Merav Parter · 2017
Later among the works it cites.
Source-wise round-trip spanners
Chun Jiang Zhu and Kam-Yiu Lam · 2017
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.
Linear size distance preservers
Greg Bodwin · 2017
Later among the works it cites.
Preserving distances in very faulty graphs
Greg Bodwin, Fabrizio Grandoni, Merav Parter, and Virginia Vassilevska Williams · 2017
Later among the works it cites.
Minor-free graphs have light spanners
Glencora Borradaile, Hung Le, and Christian Wulff-Nilsen · 2017
Later among the works it cites.
Approximating spanners and directed Steiner forest: Upper and lower bounds
Eden Chlamtáč, Michael Dinitz, Guy Kortsarz, and Bundit Laekhanukit · 2017
Later among the works it cites.
Terminal embeddings
Michael Elkin, Arnold Filtser, and Ofer Neiman · 2017
Later among the works it cites.
Distance-preserving subgraphs of interval graphs
Kshitij Gajjar and Jaikumar Radhakrishnan · 2017
Later among the works it cites.
Multiple Source Dual Fault Tolerant BFS Trees
Manoj Gupta and Shahbaz Khan · 2017
Later among the works it cites.
New pairwise spanners
Telikepalli Kavitha · 2017
Later among the works it cites.
Additive spanners and distance oracles in quadratic time
Mathias Bæk Tejs Knudsen · 2017
Later among the works it cites.
Vertex fault tolerant additive spanners
Merav Parter · 2017
Later among the works it cites.
Source-wise round-trip spanners
Chun Jiang Zhu and Kam-Yiu Lam · 2017
Later among the works it cites.
Reachability preservers: New extremal bounds and approximation algorithms
Amir Abboud and Greg Bodwin · 2018
Later among the works it cites.
A hierarchy of lower bounds for sublinear additive spanners
Amir Abboud, Greg Bodwin, and Seth Pettie · 2018
Later among the works it cites.
Ramsey spanning trees and their applications
Ittai Abraham, Shiri Chechik, Michael Elkin, Arnold Filtser, and Ofer Neiman · 2018
Later among the works it cites.
Mixed-integer programming approaches for the tree t ∗ t^{*} -spanner problem
Eduardo Álvarez-Miranda and Markus Sinnl · 2018
Later among the works it cites.
Towards tight approximation bounds for graph diameter and eccentricities
Arturs Backurs, Liam Roditty, Gilad Segal, Virginia Vassilevska Williams, and Nicole Wein · 2018
Later among the works it cites.
Optimal vertex fault tolerant spanners (for fixed stretch)
Greg Bodwin, Michael Dinitz, Merav Parter, and Virginia Vassilevska Williams · 2018
Later among the works it cites.
Near-Optimal Distance Emulator for Planar Graphs
Hsien-Chih Chang, Pawel Gawrychowski, Shay Mozes, and Oren Weimann · 2018
Later among the works it cites.
Near-optimal light spanners
Shiri Chechik and Christian Wulff-Nilsen · 2018
Later among the works it cites.
Keerti Choudhary and Omer Gold · 2018
Later among the works it cites.
Efficient algorithms for constructing very sparse spanners and emulators
Michael Elkin and Ofer Neiman · 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.
NP-hardness and fixed-parameter tractability of the minimum spanner problem
Yusuke Kobayashi · 2018
Later among the works it cites.
Artifical bee colony algorithm using problem-specific neighborhood strategies for the tree t t -spanner problem
Kavita Singh and Shyam Sundar · 2018
Later among the works it cites.
Deterministic improved round-trip spanners
Chun Jiang Zhu and Kam-Yiu Lam · 2018
Later among the works it cites.
Reachability preservers: New extremal bounds and approximation algorithms
Amir Abboud and Greg Bodwin · 2018
Later among the works it cites.
A hierarchy of lower bounds for sublinear additive spanners
Amir Abboud, Greg Bodwin, and Seth Pettie · 2018
Later among the works it cites.
Ramsey spanning trees and their applications
Ittai Abraham, Shiri Chechik, Michael Elkin, Arnold Filtser, and Ofer Neiman · 2018
Later among the works it cites.
Mixed-integer programming approaches for the tree t ∗ t^{*} -spanner problem
Eduardo Álvarez-Miranda and Markus Sinnl · 2018
Later among the works it cites.
Towards tight approximation bounds for graph diameter and eccentricities
Arturs Backurs, Liam Roditty, Gilad Segal, Virginia Vassilevska Williams, and Nicole Wein · 2018
Later among the works it cites.
Optimal vertex fault tolerant spanners (for fixed stretch)
Greg Bodwin, Michael Dinitz, Merav Parter, and Virginia Vassilevska Williams · 2018
Later among the works it cites.
Near-Optimal Distance Emulator for Planar Graphs
Hsien-Chih Chang, Pawel Gawrychowski, Shay Mozes, and Oren Weimann · 2018
Later among the works it cites.
Near-optimal light spanners
Shiri Chechik and Christian Wulff-Nilsen · 2018
Later among the works it cites.
Keerti Choudhary and Omer Gold · 2018
Later among the works it cites.
Efficient algorithms for constructing very sparse spanners and emulators
Michael Elkin and Ofer Neiman · 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.
NP-hardness and fixed-parameter tractability of the minimum spanner problem
Yusuke Kobayashi · 2018
Later among the works it cites.
Artifical bee colony algorithm using problem-specific neighborhood strategies for the tree t t -spanner problem
Kavita Singh and Shyam Sundar · 2018
Later among the works it cites.
Deterministic improved round-trip spanners
Chun Jiang Zhu and Kam-Yiu Lam · 2018
Later among the works it cites.
Approximation algorithms and an integer program for multi-level graph spanners
Reyan Ahmed, Keaton Hamm, Mohammad Javad Latifi Jebelli, Stephen Kobourov, Faryad Darabi Sahneh, and Richard Spence · 2019
Closest in time.
Multi-level graph sketches via single-level solvers
Reyan Ahmed, Keaton Hamm, Mohammad Javad Latifi Jebelli, Stephen Kobourov, Faryad Darabi Sahneh, and Richard Spence · 2019
Closest in time.
A deamortization approach for dynamic spanner and dynamic maximal matching
Aaron Bernstein, Sebastian Forster, and Monika Henzinger · 2019
Closest in time.
On the structure of unique shortest paths in graphs
Greg Bodwin · 2019
Closest in time.
A trivial yet optimal solution to vertex fault tolerant spanners
Greg Bodwin and Shyamal Patel · 2019
Closest in time.
Greedy spanners are optimal in doubling metrics
Glencora Borradaile, Hung Le, and Christian Wulff-Nilsen · 2019
Closest in time.
The sparsest additive spanner via multiple weighted BFS trees
Keren Censor-Hillel, Ami Paz, and Noam Ravid · 2019
Closest in time.
Lasserre integrality gaps for graph spanners and related problems
Michael Dinitz, Yasamin Nazari, and Zeyu Zhang · 2019
Closest in time.
Distributed construction of light networks
Michael Elkin, Arnold Filtser, and Ofer Neiman · 2019
Closest in time.
Almost shortest paths and pram distance oracles in weighted graphs
Michael Elkin, Yuval Gitlitz, and Ofer Neiman · 2019
Closest in time.
Near-additive spanners in low polynomial deterministic congest time
Michael Elkin and Shaked Matar · 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.
An FPT algorithm for minimum additive spanner problem
Yusuke Kobayashi · 2019
Closest in time.
A steady-state genetic algorithm for the tree t t -spanner problem
Shyam Sundar · 2019
Closest in time.
Approximation algorithms and an integer program for multi-level graph spanners
Reyan Ahmed, Keaton Hamm, Mohammad Javad Latifi Jebelli, Stephen Kobourov, Faryad Darabi Sahneh, and Richard Spence · 2019
Closest in time.
Multi-level graph sketches via single-level solvers
Reyan Ahmed, Keaton Hamm, Mohammad Javad Latifi Jebelli, Stephen Kobourov, Faryad Darabi Sahneh, and Richard Spence · 2019
Closest in time.
A deamortization approach for dynamic spanner and dynamic maximal matching
Aaron Bernstein, Sebastian Forster, and Monika Henzinger · 2019
Closest in time.
On the structure of unique shortest paths in graphs
Greg Bodwin · 2019
Closest in time.
A trivial yet optimal solution to vertex fault tolerant spanners
Greg Bodwin and Shyamal Patel · 2019
Closest in time.
Greedy spanners are optimal in doubling metrics
Glencora Borradaile, Hung Le, and Christian Wulff-Nilsen · 2019
Closest in time.
The sparsest additive spanner via multiple weighted BFS trees
Keren Censor-Hillel, Ami Paz, and Noam Ravid · 2019
Closest in time.
Lasserre integrality gaps for graph spanners and related problems
Michael Dinitz, Yasamin Nazari, and Zeyu Zhang · 2019
Closest in time.
Distributed construction of light networks
Michael Elkin, Arnold Filtser, and Ofer Neiman · 2019
Closest in time.
Almost shortest paths and pram distance oracles in weighted graphs
Michael Elkin, Yuval Gitlitz, and Ofer Neiman · 2019
Closest in time.
Near-additive spanners in low polynomial deterministic congest time
Michael Elkin and Shaked Matar · 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.
An FPT algorithm for minimum additive spanner problem
Yusuke Kobayashi · 2019
Closest in time.
A steady-state genetic algorithm for the tree t t -spanner problem
Shyam Sundar · 2019
Closest in time.
Reyan Ahmed, Greg Bodwin, Faryad Darabi Sahneh, Stephen Kobourov, and Richard Spence · 2020
Closest in time.
New ( α \alpha , β \beta ) spanners and hopsets
Uri Ben-Levy and Merav Parter · 2020
Closest in time.
Some general structure for extremal sparsification problems
Greg Bodwin · 2020
Closest in time.
Extremal distances in directed graphs: Tight spanners and near-optimal approximation algorithms
Keerti Choudhary and Omer Gold · 2020
Closest in time.
Near-additive spanners and near-exact hopsets, a unified view
Michael Elkin and Ofer Neiman · 2020
Closest in time.
Reyan Ahmed, Greg Bodwin, Faryad Darabi Sahneh, Stephen Kobourov, and Richard Spence · 2020
Closest in time.
New ( α \alpha , β \beta ) spanners and hopsets
Uri Ben-Levy and Merav Parter · 2020
Closest in time.
Some general structure for extremal sparsification problems
Greg Bodwin · 2020
Closest in time.
Extremal distances in directed graphs: Tight spanners and near-optimal approximation algorithms
Keerti Choudhary and Omer Gold · 2020
Closest in time.
Near-additive spanners and near-exact hopsets, a unified view
Michael Elkin and Ofer Neiman · 2020
Closest in time.