A Faster Distributed Single-Source Shortest Paths Algorithm

We devise new algorithms for the single-source shortest paths (SSSP) problem with non-negative edge weights in the CONGEST model of distributed computing. While close-to-optimal solutions, in terms of the number of rounds spent by the algorithm, have recently been developed for computing SSSP approximately, the fastest known exact algorithms are still far away from matching the lower bound of Ω (n + D) rounds by Peleg and Rubinovich [SIAM Journal on Computing 2000], where n is the number of nodes in the network and D is its diameter. The state of the art is Elkin's randomized algorithm [STOC 2017] that performs Õ(n^2/3 D^1/3 + n^5/6) rounds. We significantly improve upon this upper bound with our two new randomized algorithms for polynomially bounded integer edge weights, the first performing Õ(√n D) rounds and the second performing Õ(√n D^1/4 + n^3/5 + D) rounds. Our bounds also compare favorably to the independent result by Ghaffari and Li [STOC 2018]. As side results, we obtain a (1+ε)-approximation Õ((√n D^1/4+D)/ε)-round algorithm for directed SSSP and a new work/depth trade-off for exact SSSP on directed graphs in the PRAM model.

[1]  Boaz Patt-Shamir,et al.  Near-Optimal Distributed Maximum Flow: Extended Abstract , 2015, PODC.

[2]  Peter Sanders,et al.  [Delta]-stepping: a parallelizable shortest path algorithm , 2003, J. Algorithms.

[3]  Michael Elkin,et al.  Hopsets with Constant Hopbound, and Applications to Approximate Shortest Paths , 2016, 2016 IEEE 57th Annual Symposium on Foundations of Computer Science (FOCS).

[4]  Fabian Kuhn,et al.  Distributed Minimum Cut Approximation , 2013, DISC.

[5]  Bernhard Haeupler,et al.  Faster Distributed Shortest Path Approximations via Shortcuts , 2018, DISC.

[6]  Pierre A. Humblet,et al.  A Distributed Algorithm for Minimum-Weight Spanning Trees , 1983, TOPL.

[7]  L. R. Ford,et al.  NETWORK FLOW THEORY , 1956 .

[8]  David Peleg,et al.  A Near-Tight Lower Bound on the Time Complexity of Distributed Minimum-Weight Spanning Tree Construction , 2000, SIAM J. Comput..

[9]  Matteo Pontecorvi,et al.  A Deterministic Distributed Algorithm for Exact Weighted All-Pairs Shortest Paths in Õ(n 3/2 ) Rounds , 2018, PODC.

[10]  Robert E. Tarjan,et al.  Faster Scaling Algorithms for Network Problems , 1989, SIAM J. Comput..

[11]  Michael Elkin,et al.  Distributed exact shortest paths in sublinear time , 2017, STOC.

[12]  Hsin-Hao Su,et al.  Almost-Tight Distributed Minimum Cut Algorithms , 2014, DISC.

[13]  Shay Kutten,et al.  Fast Distributed Construction of Small k-Dominating Sets and Applications , 1998, J. Algorithms.

[14]  Thomas H. Spencer,et al.  Time-work tradeoffs for parallel algorithms , 1997, JACM.

[15]  Michael Elkin.  An Unconditional Lower Bound on the Time-Approximation Trade-off for the Distributed Minimum Spanning Tree Problem , 2006, SIAM J. Comput..

[16]  David Peleg,et al.  Tight Bounds for Distributed Minimum-Weight Spanning Tree Verification , 2013, Theory of Computing Systems.

[17]  Mohsen Ghaffari,et al.  Near-Optimal Distributed Approximation of Minimum-Weight Connected Dominating Set , 2014, ICALP.

[18]  Harold N. Gabow,et al.  Scaling algorithms for network problems , 1983, 24th Annual Symposium on Foundations of Computer Science (sfcs 1983).

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

[20]  Nathan Linial,et al.  Locality in Distributed Graph Algorithms , 1992, SIAM J. Comput..

[21]  Guy E. Blelloch,et al.  Parallel Shortest Paths Using Radius Stepping , 2016, SPAA.

[22]  Eli Gafni,et al.  Improvements in the time complexity of two message-optimal election algorithms , 1985, PODC '85.

[23]  Boaz Patt-Shamir,et al.  Fast Routing Table Construction Using Small Messages , 2012, ArXiv.

[24]  David Peleg,et al.  Distributed Algorithms for Network Diameter and Girth , 2012, ICALP.

[25]  Boaz Patt-Shamir,et al.  Fast Partial Distance Estimation and Applications , 2014, PODC.

[26]  Bernhard Haeupler,et al.  Round- and Message-Optimal Distributed Graph Algorithms , 2018, PODC.

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

[28]  Edith Cohen,et al.  Polylog-time and near-linear work approximation scheme for undirected shortest paths , 1994, STOC '94.

[29]  Fabian Kuhn,et al.  Distributed Approximate Maximum Matching in the CONGEST Model , 2018, DISC.

[30]  Reuven Bar-Yehuda,et al.  Distributed Approximation of Maximum Independent Set and Maximum Matching , 2017, PODC.

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

[32]  Thatchaphol Saranurak,et al.  Distributed Exact Weighted All-Pairs Shortest Paths in Õ(n^{5/4}) Rounds , 2017, 2017 IEEE 58th Annual Symposium on Foundations of Computer Science (FOCS).

[33]  Aleksander Madry,et al.  Faster approximation schemes for fractional multicommodity flow problems via dynamic graph algorithms , 2010, STOC '10.

[34]  Baruch Awerbuch,et al.  Optimal distributed algorithms for minimum weight spanning tree, counting, leader election, and related problems , 1987, STOC.

[35]  Mihalis Yannakakis,et al.  High-Probability Parallel Transitive-Closure Algorithms , 1991, SIAM J. Comput..

[36]  Hartmut Klauck,et al.  Can quantum communication speed up distributed computation? , 2012, PODC.

[37]  Andrew V. Goldberg,et al.  Scaling algorithms for the shortest paths problem , 1995, SODA '93.

[38]  Edith Cohen.  Using Selective Path-Doubling for Parallel Shortest-Path Computations , 1997, J. Algorithms.

[39]  Gary L. Miller,et al.  Improved Parallel Algorithms for Spanners and Hopsets , 2015, SPAA.

[40]  Polylog-time and near-linear work approximation scheme for undirected shortest paths , 2000, JACM.

[41]  Christoph Lenzen,et al.  Near-Optimal Approximate Shortest Paths and Transshipment in Distributed and Streaming Models , 2016, DISC.

[42]  David Peleg,et al.  Distributed Computing: A Locality-Sensitive Approach , 1987 .

[43]  Danupon Nanongkai,et al.  Distributed approximation algorithms for weighted shortest paths , 2014, STOC.

[44]  Christoph Lenzen,et al.  Efficient distributed source detection with limited bandwidth , 2013, PODC '13.

[45]  Roger Wattenhofer,et al.  Networks cannot compute their diameter in sublinear time , 2012, SODA.

[46]  Jesper Larsson Träff,et al.  A Parallel Priority Queue with Constant Time Operations , 1998, J. Parallel Distributed Comput..

[47]  Bernhard Haeupler,et al.  Round- and Message-Optimal Distributed Part-Wise Aggregation , 2018, ArXiv.

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

[49]  Mohsen Ghaffari,et al.  Brief Announcement: Distributed Single-Source Reachability , 2015, PODC.

[50]  Mohsen Ghaffari,et al.  Improved distributed algorithms for exact shortest paths , 2018, STOC.

[51]  Roger Wattenhofer,et al.  Optimal distributed all pairs shortest paths and applications , 2012, PODC '12.

[52]  Michael Elkin,et al.  A Simple Deterministic Distributed MST Algorithm, with Near-Optimal Time and Message Complexities , 2017, PODC.

[53]  Francis Y. L. Chin,et al.  An almost linear time and O(nlogn+e) Messages distributed algorithm for minimum-weight spanning trees , 1985, 26th Annual Symposium on Foundations of Computer Science (sfcs 1985).

[54]  Philip N. Klein,et al.  A Randomized Parallel Algorithm for Single-Source Shortest Paths , 1997, J. Algorithms.

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

[56]  Thomas H. Spencer,et al.  Time-Work Tradeoffs of the Single-Source Shortest Paths Problem , 1999, J. Algorithms.

[57]  T. Lindvall.  ON A ROUTING PROBLEM , 2004, Probability in the Engineering and Informational Sciences.

[58]  Christoph Lenzen,et al.  Algebraic methods in the congested clique , 2015, Distributed Computing.