A Subquadratic-Time Algorithm for Decremental Single-Source Shortest Paths

We study dynamic (1 + e)-approximation algorithms for the single-source shortest paths problem in an unweighted undirected n-node m-edge graph under edge deletions. The fastest algorithm for this problem is an algorithm with O(n2+o(1)) total update time and constant query time by Bernstein and Roditty (SODA 2011). In this paper, we improve the total update time to O(n1.8+o(1) + m1+o(1)) while keeping the query time constant. This running time is essentially tight when m = Ω(n1.8) since we need Ω(m) time even in the static setting. For smaller values of m, the running time of our algorithm is subquadratic, and is the first that breaks through the quadratic time barrier. In obtaining this result, we develop a fast algorithm for what we call center cover data structure. We also make non-trivial extensions to our previous techniques called lazy-update and monotone Even-Shiloach trees (ICALP 2013 and FOCS 2013). As by-products of our new techniques, we obtain two new results for the decremental all-pairs shortest-paths problem. Our first result is the first approximation algorithm whose total update time is faster than O(mn) for all values of m. Our second result is a new trade-off between the total update time and the additive approximation guarantee.

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

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

[3]  Aaron Bernstein.  Maintaining shortest paths under deletions in weighted directed graphs: [extended abstract] , 2013, STOC '13.

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

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

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

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

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

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

[10]  Aaron Bernstein.  Maintaining Shortest Paths Under Deletions in Weighted Directed Graphs , 2016, SIAM J. Comput..

[11]  Mikkel Thorup,et al.  Approximate distance oracles , 2005, J. ACM.

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

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

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

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

[16]  Swastik Kopparty,et al.  TO PLANAR GRAPHS , 2010 .

[17]  Mikkel Thorup,et al.  A Space Saving Trick for Directed Dynamic Transitive Closure and Shortest Path Algorithms , 2001, COCOON.

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

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

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

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

[22]  Monika Henzinger,et al.  Dynamic Approximate All-Pairs Shortest Paths: Breaking the O(mn) Barrier and Derandomization , 2013, 2013 IEEE 54th Annual Symposium on Foundations of Computer Science.

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

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

[25]  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.

[26]  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).

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