Dynamic Approximate All-Pairs Shortest Paths: Breaking the O(mn) Barrier and Derandomization

We study dynamic (1 + ϵ)-approximation algorithms for the all-pairs shortest paths problem in unweighted undirected n-node m-edge graphs under edge deletions. The fastest algorithm for this problem is a randomized algorithm with a total update time of Ȏ(mn) and constant query time by Roditty and Zwick (FOCS 2004). The fastest deterministic algorithm is from a 1981 paper by Even and Shiloach (JACM 1981); it has a total update time of O(mn2) and constant query time. We improve these results as follows: (1) We present an algorithm with a total update time of Ȏ(n5/2) and constant query time that has an additive error of two in addition to the 1 + ϵ multiplicative error. This beats the previous Ȏ(mn) time when m = Ω(n3/2). Note that the additive error is unavoidable since, even in the static case, an O(n3-δ)-time (a so-called truly sub cubic) combinatorial algorithm with 1 + ϵ multiplicative error cannot have an additive error less than 2 - ϵ, unless we make a major breakthrough for Boolean matrix multiplication (Dor, Halperin and Zwick FOCS 1996) and many other long-standing problems (Vassilevska Williams and Williams FOCS 2010). The algorithm can also be turned into a (2 + ϵ)-approximation algorithm (without an additive error) with the same time guarantees, improving the recent (3 + ϵ)-approximation algorithm with Ȏ(n5/2+O(1√(log n))) running time of Bernstein and Roditty (SODA 2011) in terms of both approximation and time guarantees. (2) We present a deterministic algorithm with a total update time of Ȏ(mn) and a query time of O(log log n). The algorithm has a multiplicative error of 1 + ϵ and gives the first improved deterministic algorithm since 1981. It also answers an open question raised by Bernstein in his STOC 2013 paper. In order to achieve our results, we introduce two new techniques: (1) A lazy Even-Shiloach tree algorithm which maintains a bounded-distance shortest-paths tree on a certain type of emulator called locally persevering emulator. (2) A derandomization technique based on moving Even-Shiloach trees as a way to derandomize the standard random set argument. These techniques might be of independent interest.

[1]  Giuseppe F. Italiano,et al.  Fully dynamic all pairs shortest paths with real edge weights , 2001, Proceedings 2001 IEEE International Conference on Cluster Computing.

[2]  Satish Rao,et al.  Planar graphs, negative weight edges, shortest paths, and near linear time , 2006, J. Comput. Syst. Sci..

[3]  Lenore Cowen,et al.  Near-Linear Time Construction of Sparse Neighborhood Covers , 1999, SIAM J. Comput..

[4]  Monika Henzinger,et al.  Sublinear-time decremental algorithms for single-source reachability and shortest paths on directed graphs , 2014, STOC.

[5]  Mikkel Thorup,et al.  Poly-logarithmic deterministic fully-dynamic algorithms for connectivity, minimum spanning tree, 2-edge, and biconnectivity , 2001, JACM.

[6]  Monika Henzinger,et al.  Fully dynamic biconnectivity and transitive closure , 1995, Proceedings of IEEE 36th Annual Foundations of Computer Science.

[7]  Uri Zwick,et al.  All pairs shortest paths using bridging sets and rectangular matrix multiplication , 2000, JACM.

[8]  Giuseppe F. Italiano,et al.  On-Line Computation of Minimal and Maximal Length Paths , 1992, Theor. Comput. Sci..

[9]  Friedhelm Meyer auf der Heide,et al.  Dynamic perfect hashing: upper and lower bounds , 1988, [Proceedings 1988] 29th Annual Symposium on Foundations of Computer Science.

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

[11]  Giuseppe F. Italiano,et al.  Incremental algorithms for minimal length paths , 1991, SODA '90.

[12]  Shimon Even,et al.  An On-Line Edge-Deletion Problem , 1981, JACM.

[13]  Giuseppe F. Italiano,et al.  Fully dynamic all pairs shortest paths with real edge weights , 2006, J. Comput. Syst. Sci..

[14]  Amir Abboud,et al.  Popular Conjectures Imply Strong Lower Bounds for Dynamic Problems , 2014, 2014 IEEE 55th Annual Symposium on Foundations of Computer Science.

[15]  L. Brim,et al.  Faster algorithms for mean-payoff games , 2011, Formal Methods Syst. Des..

[16]  Ittai Abraham,et al.  Dynamic Decremental Approximate Distance Oracles with (1+ε, 2) stretch , 2013, ArXiv.

[17]  Ramesh Hariharan,et al.  Improved decremental algorithms for maintaining transitive closure and all-pairs shortest paths , 2002, STOC '02.

[18]  Michael Elkin,et al.  Streaming and fully dynamic centralized algorithms for constructing and maintaining sparse spanners , 2007, TALG.

[19]  Uri Zwick,et al.  All-Pairs Almost Shortest Paths , 1997, SIAM J. Comput..

[20]  Allan Borodin,et al.  On the power of randomization in online algorithms , 1990, STOC '90.

[21]  Uri Zwick,et al.  On Dynamic Shortest Paths Problems , 2004, Algorithmica.

[22]  Edith Cohen,et al.  All-pairs small-stretch paths , 1997, SODA '97.

[23]  Aaron Bernstein,et al.  Fully Dynamic (2 + epsilon) Approximate All-Pairs Shortest Paths with Fast Query and Close to Linear Update Time , 2009, 2009 50th Annual IEEE Symposium on Foundations of Computer Science.

[24]  Valerie King,et al.  Fully dynamic algorithms for maintaining all-pairs shortest paths and transitive closure in digraphs , 1999, 40th Annual Symposium on Foundations of Computer Science (Cat. No.99CB37039).

[25]  Monika Henzinger,et al.  Dynamic Approximate All-Pairs Shortest Paths: Breaking the O(mn) Barrier and Derandomization , 2013, FOCS.

[26]  Rasmus Pagh,et al.  Cuckoo Hashing , 2001, Encyclopedia of Algorithms.

[27]  Peter S Loubai.  A NETWORK EVALUATION PROCEDURE , 1967 .

[28]  Giuseppe F. Italiano,et al.  A new approach to dynamic all pairs shortest paths , 2003, STOC '03.

[29]  Uri Zwick,et al.  Dynamic approximate all-pairs shortest paths in undirected graphs , 2004, 45th Annual IEEE Symposium on Foundations of Computer Science.

[30]  Giri Narasimhan,et al.  Fast algorithms for constructing t-spanners and paths with stretch t , 1993, Proceedings of 1993 IEEE 34th Annual Foundations of Computer Science.

[31]  Liam Roditty,et al.  Improved dynamic algorithms for maintaining approximate shortest paths under deletions , 2011, SODA '11.

[32]  Mihalis Yannakakis,et al.  High-probability parallel transitive closure algorithms , 1990, SPAA '90.

[33]  Allan Borodin,et al.  On the power of randomization in on-line algorithms , 2005, Algorithmica.

[34]  Giuseppe F. Italiano,et al.  Small Stretch Spanners on Dynamic Graphs , 2005, J. Graph Algorithms Appl..

[35]  Giuseppe F. Italiano,et al.  Improved Bounds and New Trade-Offs for Dynamic All Pairs Shortest Paths , 2002, ICALP.

[36]  Giuseppe F. Italiano,et al.  A new approach to dynamic all pairs shortest paths , 2004, JACM.

[37]  Mikkel Thorup,et al.  Approximate distance oracles , 2001, JACM.

[38]  Monika Henzinger,et al.  A Subquadratic-Time Algorithm for Decremental Single-Source Shortest Paths , 2014, SODA.

[39]  Mikkel Thorup,et al.  Fully-Dynamic All-Pairs Shortest Paths: Faster and Allowing Negative Cycles , 2004, SWAT.

[40]  Monika Henzinger,et al.  Decremental Single-Source Shortest Paths on Undirected Graphs in Near-Linear Total Update Time , 2014, 2014 IEEE 55th Annual Symposium on Foundations of Computer Science.

[41]  Ramesh Hariharan,et al.  Maintaining all-pairs approximate shortest paths under deletion of edges , 2003, SODA '03.

[42]  Soumojit Sarkar,et al.  Fully dynamic randomized algorithms for graph spanners , 2012, TALG.

[43]  Raphael Yuster,et al.  All Pairs Bottleneck Paths and Max-Min Matrix Products in Truly Subcubic Time , 2009, Theory Comput..

[44]  Ramesh Hariharan,et al.  Improved decremental algorithms for maintaining transitive closure and all-pairs shortest paths , 2007, J. Algorithms.

[45]  David Peleg,et al.  (1 + εΒ)-spanner constructions for general graphs , 2001, STOC '01.

[46]  Monika Henzinger,et al.  Unifying and Strengthening Hardness for Dynamic Problems via the Online Matrix-Vector Multiplication Conjecture , 2015, STOC.

[47]  Michael Elkin,et al.  Computing almost shortest paths , 2001, TALG.

[48]  Monika Henzinger,et al.  Maintaining Minimum Spanning Forests in Dynamic Graphs , 2001, SIAM J. Comput..

[49]  Mikkel Thorup,et al.  Spanners and emulators with sublinear distance errors , 2006, SODA '06.

[50]  Allan Borodin,et al.  Online computation and competitive analysis , 1998 .

[51]  Liam Roditty,et al.  Approximating the Girth , 2013, TALG.

[52]  Philip N. Klein,et al.  Faster Shortest-Path Algorithms for Planar Graphs , 1997, J. Comput. Syst. Sci..