A Distributed Algorithm for Directed Minimum-Weight Spanning Tree
In the directed minimum spanning tree problem (DMST, also called minimum weight arborescence), the network is given a root node r, and needs to construct a minimum-weight directed spanning tree, rooted at r and oriented outwards. In this paper we present the first sub-quadratic DMST algorithms in the distributed CONGEST network model, where the messages exchanged between the network nodes are bounded in size. We consider three versions: a model where the communication links are bidirectional but can have different weights in the two directions; a model where communication is unidirectional; and the Congested Clique model, where all nodes can communicate directly with each other.
Our algorithm is based on a variant of Lovász' DMST algorithm for the PRAM model, and uses a distributed single-source shortest-path (SSSP) algorithm for directed graphs as a black box. In the bidirectional CONGEST model, our algorithm has roughly the same running time as the SSSP algorithm; using the state-of-the-art SSSP algorithm, we obtain a running time of O~(min(sqrt{nD},sqrt{n}D^{1/4} + n^{3/5} +D)) rounds for the bidirectional communication case.
For the unidirectional communication model we give an O~(n) algorithm, and show that it is nearly optimal. And finally, for the Congested Clique, our algorithm again matches the best known SSSP algorithm: it runs in O~(n^{1/3}) rounds.
On the negative side, we adapt an observation of Chechik in the sequential setting to show that in all three models, the DMST problem is at least as hard as the (s,t)-shortest path problem. Thus, in terms of round complexity, distributed DMST lies between single-source shortest path and (s,t)-shortest path.
Distributed Computing
Directed Minimum Spanning Tree
Minimum Arborescence
CONGEST
Networks~Network algorithms
Theory of computation~Distributed algorithms
16:1-16:16
Regular Paper
A full version of the paper is available at https://www.cs.tau.ac.il/~roshman/papers/DISC19_FO.pdf.
Orr
Fischer
Orr Fischer
Computer Science Department, Tel-Aviv University, Israel
Research supported by the Israeli Centers of Research Excellence (I-CORE) program (Center No. 4/11) and the Laura Schwarz-Kipp Institute of Computer Networks.
Rotem
Oshman
Rotem Oshman
Computer Science Department, Tel-Aviv University, Israel
Research supported by the Israeli Centers of Research Excellence (I-CORE) program (Center No. 4/11).
10.4230/LIPIcs.DISC.2019.16
Aaron Bernstein and Danupon Nanongkai. Distributed Exact Weighted All-Pairs Shortest Paths in Near-Linear Time. In Proceedings of the 51th Annual ACM SIGACT Symposium on Theory of Computing, STOC '19, 2019.
F. Bock. An algorithm to construct a minimum directed spanning tree in a directed network. In Developments in Operations Research, pages 29-44, 1971.
Keren Censor-Hillel, Petteri Kaski, Janne H. Korhonen, Christoph Lenzen, Ami Paz, and Jukka Suomela. Algebraic Methods in the Congested Clique. In Proceedings of the 2015 ACM Symposium on Principles of Distributed Computing, PODC 2015, pages 143-152, 2015.
S. Chechik. Private Communication.
Mohit Daga, Monika Henzinger, Danupon Nanongkai, and Thatchaphol Saranurak. Distributed Edge Connectivity in Sublinear Time. In Proceedings of the 51th Annual ACM SIGACT Symposium on Theory of Computing, STOC '19, 2019.
Tarjan R. E. Finding optimum branchings. Networks, 7(1):25-35, 1965.
Jack Edmonds. Optimum branchings. Journal of Research of the National Bureau of Standards, 71B(4):233-240, 1967.
M. Elkin. An Unconditional Lower Bound on the Time-Approximation Trade-off for the Distributed Minimum Spanning Tree Problem. SIAM Journal on Computing, 36(2):433-456, 2006.
Michael Elkin. A faster distributed protocol for constructing a minimum spanning tree. J. Comput. Syst. Sci., 72(8):1282-1308, 2006.
Michael Elkin. A Simple Deterministic Distributed MST Algorithm, with Near-Optimal Time and Message Complexities. In Proceedings of the ACM Symposium on Principles of Distributed Computing, (PODC), pages 157-163, 2017.
Orr Fischer and Rotem Oshman. A Distributed Algorithm for Directed Minimum-Weight Spanning Tree. URL: https://www.cs.tau.ac.il/~roshman/papers/DISC19_FO.pdf.
https://www.cs.tau.ac.il/~roshman/papers/DISC19_FO.pdf
Sebastian Forster and Danupon Nanongkai. A Faster Distributed Single-Source Shortest Paths Algorithm. In 59th IEEE Annual Symposium on Foundations of Computer Science, (FOCS), pages 686-697, 2018.
H N Gabow, Z Galil, T Spencer, and R E Tarjan. Efficient Algorithms for Finding Minimum Spanning Trees in Undirected and Directed Graphs. Combinatorica, 6(2):109-122, January 1986.
J. A. Garay, S. Kutten, and D. Peleg. A sub-linear time distributed algorithm for minimum-weight spanning trees. In Proceedings of 1993 IEEE 34th Annual Foundations of Computer Science, pages 659-668, 1993.
Mohsen Ghaffari and Bernhard Haeupler. Distributed Algorithms for Planar Networks II: Low-Congestion Shortcuts, MST, and Min-Cut. In Proceedings of the Twenty-Seventh Annual ACM-SIAM Symposium on Discrete Algorithms, SODA, pages 202-219, 2016.
Mohsen Ghaffari and Jason Li. Improved Distributed Algorithms for Exact Shortest Paths. In Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing, STOC 2018, pages 431-444, 2018.
Mohsen Ghaffari and Merav Parter. MST in log-star rounds of congested clique. In Proceedings of the 2016 ACM Symposium on Principles of Distributed Computing, PODC, pages 19-28, 2016.
Bernhard Haeupler, Taisuke Izumi, and Goran Zuzic. Low-Congestion Shortcuts without Embedding. In Proceedings of the 2016 ACM Symposium on Principles of Distributed Computing (PODC) 2016, pages 451-460, 2016.
Bernhard Haeupler and Jason Li. Faster Distributed Shortest Path Approximations via Shortcuts. In 32nd International Symposium on Distributed Computing, (DISC) 2018, pages 33:1-33:14, 2018.
Monika Henzinger, Sebastian Krinninger, and Danupon Nanongkai. A Deterministic Almost-tight Distributed Algorithm for Approximating Single-source Shortest Paths. In Proceedings of the Forty-eighth Annual ACM Symposium on Theory of Computing, STOC '16, pages 489-498, 2016.
P. Humblet. A Distributed Algorithm for Minimum Weight Directed Spanning Trees. IEEE Transactions on Communications, 31(6):756-762, 1983.
Tomasz Jurdzinski and Krzysztof Nowicki. MST in O(1) rounds of congested clique. In Proceedings of the Twenty-Ninth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2018, pages 2620-2632, 2018.
Zvi Lotker, Boaz Patt-Shamir, Elan Pavlov, and David Peleg. Minimum-Weight Spanning Tree Construction in O(log log n) Communication Rounds. SIAM J. Comput., 35(1):120-131, 2005.
L. Lovasz. Computing ears and branchings in parallel. In 26th Annual Symposium on Foundations of Computer Science (sfcs 1985)(FOCS), volume 00, pages 464-467, 1985.
Danupon Nanongkai. Distributed Approximation Algorithms for Weighted Shortest Paths. In Proceedings of the Forty-sixth Annual ACM Symposium on Theory of Computing, STOC '14, pages 565-573, 2014.
Gopal Pandurangan, Peter Robinson, and Michele Scquizzato. A Time- and Message-optimal Distributed Algorithm for Minimum Spanning Trees. In Proceedings of the 49th Annual ACM SIGACT Symposium on Theory of Computing, STOC 2017, pages 743-756, 2017.
D. Peleg and V. Rubinovich. A near-tight lower bound on the time complexity of distributed MST construction. In 40th Annual Symposium on Foundations of Computer Science (FOCS), pages 253-261, 1999.
F. Maffioli P.M. Camerini, L. Fratta. A note on finding optimum branchings. Networks, 7:309–-312, 1979.
F. Maffioli P.M. Camerini, L. Fratta. The k best spanning arborescences of a network. Networks, 10(2):91–-109, 1980.
Atish Das Sarma, Stephan Holzer, Liah Kor, Amos Korman, Danupon Nanongkai, Gopal Pandurangan, David Peleg, and Roger Wattenhofer. Distributed Verification and Hardness of Distributed Approximation. SIAM J. Comput., 41(5):1235-1265, 2012.
Ramakrishna Thurimella. Sub-linear Distributed Algorithms for Sparse Certificates and Biconnected Components. In Proceedings of the Fourteenth Annual ACM Symposium on Principles of Distributed Computing, PODC '95, 1995.
T.H. Liu. Y.J. Chu. On the shortest arborescence of a directed graph. Sci. Sinica, 14(2):1396-1400, 1965.
Orr Fischer and Rotem Oshman
Creative Commons Attribution 3.0 Unported license
https://creativecommons.org/licenses/by/3.0/legalcode