Improved Purely Additive Fault-Tolerant Spanners

Let G be an unweighted n-node undirected graph. A β-additive spanner of G is a spanning subgraph H of G such that distances in H are stretched at most by an additive term β w.r.t. the corresponding distances in G. A natural research goal related with spanners is that of designing sparse spanners with low stretch.

[1]  Fabrizio Grandoni,et al.  On Pairwise Spanners , 2013, STACS.

[2]  Michael Langberg,et al.  Fault-tolerant spanners for general graphs , 2009, STOC '09.

[3]  David Peleg,et al.  Fault Tolerant Additive Spanners , 2012, WG.

[4]  Michael Elkin,et al.  Sparse Sourcewise and Pairwise Distance Preservers , 2006, SIAM J. Discret. Math..

[5]  Béla Bollobás,et al.  Extremal problems in graph theory , 1977, J. Graph Theory.

[6]  David P. Dobkin,et al.  On sparse spanners of weighted graphs , 1993, Discret. Comput. Geom..

[7]  Fabrizio Grandoni,et al.  Improved Distance Sensitivity Oracles via Fast Single-Source Replacement Paths , 2012, 2012 IEEE 53rd Annual Symposium on Foundations of Computer Science.

[8]  Stefano Leucci,et al.  Fault-Tolerant Approximate Shortest-Path Trees , 2017, Algorithmica.

[9]  David R. Karger,et al.  A nearly optimal oracle for avoiding failed vertices and edges , 2009, STOC '09.

[10]  Merav Parter.  Vertex fault tolerant additive spanners , 2015, Distributed Computing.

[11]  David Peleg,et al.  Sparse Fault-Tolerant BFS Trees , 2013, ESA.

[12]  Surender Baswana,et al.  Approximate Shortest Paths Avoiding a Failed Vertex: Near Optimal Data Structures for Undirected Unweighted Graphs , 2012, Algorithmica.

[13]  Shiri Chechik,et al.  New Additive Spanners , 2013, SODA.

[14]  Giuseppe F. Italiano,et al.  On Resilient Graph Spanners , 2015, Algorithmica.

[15]  Piotr Indyk,et al.  Fast estimation of diameter and shortest paths (without matrix multiplication) , 1996, SODA '96.

[16]  David Peleg,et al.  Fault Tolerant Approximate BFS Structures , 2014, SODA.

[17]  Michael Dinitz,et al.  Fault-tolerant spanners: better and simpler , 2011, PODC '11.

[18]  Michael Langberg,et al.  f-Sensitivity Distance Oracles and Routing Schemes , 2010, Algorithmica.

[19]  Kurt Mehlhorn,et al.  Additive spanners and (α, β)-spanners , 2010, TALG.