A Simple Deterministic Distributed MST Algorithm, with Near-Optimal Time and Message Complexities

Distributed minimum spanning tree (MST) problem is one of the most central and fundamental problems in distributed graph algorithms. Kutten and Peleg [KP98] devised an algorithm with running time O(D + √n . log* n), where D is the hop-diameter of the input n-vertex m-edge graph, and with message complexity O(m + n3/2). Peleg and Rubinovich [PR99] showed that the running time of the algorithm of [KP98] is essentially tight, and asked if one can achieve near-optimal running time together with near-optimal message complexity. In a recent breakthrough, Pandurangan et al. [PRS16] answered this question in the affirmative, and devised a randomized algorithm with time Õ(D+ √n) and message complexity Õ(m). They asked if such a simultaneous time- and message-optimality can be achieved by a deterministic algorithm. In this paper, building upon the work of [PRS16], we answer this question in the affirmative, and devise a deterministic algorithm that computes MST in time O((D + √n). log n), using O(m . log n + n log n . log* n) messages. The polylogarithmic factors in the time and message complexities of our algorithm are significantly smaller than the respective factors in the result of [PRS16]. Also, our algorithm and its analysis are very simple and self-contained, as opposed to rather complicated previous sublinear-time algorithms [GKP98,KP98,E04b,PRS16].

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

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

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

[4]  Richard Cole,et al.  Deterministic Coin Tossing with Applications to Optimal Parallel List Ranking , 2018, Inf. Control..

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

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

[7]  Baruch Awerbuch,et al.  A trade-off between information and communication in broadcast protocols , 1990, JACM.

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

[9]  Lenore Cowen,et al.  Near-linear cost sequential and distributed constructions of sparse neighborhood covers , 1993, Proceedings of 1993 IEEE 34th Annual Foundations of Computer Science.

[10]  A Sublinear Time Distributed Algorithm for Minimum-Weight Spanning Trees , 1998, SIAM J. Comput..

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

[12]  David Peleg,et al.  A near-tight lower bound on the time complexity of distributed MST construction , 1999, 40th Annual Symposium on Foundations of Computer Science (Cat. No.99CB37039).

[13]  Michalis Faloutsos,et al.  A linear-time optimal-message distributed algorithm for minimum spanning trees , 2004, Distributed Computing.

[14]  Michael Elkin,et al.  A faster distributed protocol for constructing a minimum spanning tree , 2004, SODA '04.

[15]  Michael Elkin,et al.  Unconditional lower bounds on the time-approximation tradeoffs for the distributed minimum spanning tree problem , 2004, STOC '04.

[16]  Boaz Patt-Shamir,et al.  Distributed MST for constant diameter graphs , 2001, PODC '01.

[17]  Gurdip Singh,et al.  A highly asynchronous minimum spanning tree protocol , 1995, Distributed Computing.

[18]  Boaz Patt-Shamir,et al.  Minimum-Weight Spanning Tree Construction in O(log log n) Communication Rounds , 2005, SIAM J. Comput..

[19]  Maleq Khan,et al.  A fast distributed approximation algorithm for minimum spanning trees , 2007, Distributed Computing.

[20]  Distributed verification and hardness of distributed approximation , 2010, STOC '11.

[21]  David Peleg,et al.  Tight Bounds For Distributed MST Verification , 2011, STACS.

[22]  Distributed Verification and Hardness of Distributed Approximation , 2012, SIAM J. Comput..

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

[24]  Mikkel Thorup,et al.  Construction and Impromptu Repair of an MST in a Distributed Network with o(m) Communication , 2015, PODC.

[25]  Sriram V. Pemmaraju,et al.  Toward Optimal Bounds in the Congested Clique: Graph Connectivity and MST , 2015, PODC.

[26]  Merav Parter,et al.  MST in Log-Star Rounds of Congested Clique , 2016, PODC.

[27]  Bernhard Haeupler,et al.  Low-Congestion shortcuts without embedding , 2016, Distributed Computing.

[28]  Bernhard Haeupler,et al.  Distributed Algorithms for Planar Networks II: Low-Congestion Shortcuts, MST, and Min-Cut , 2016, SODA.

[29]  Peter Robinson,et al.  A time- and message-optimal distributed algorithm for minimum spanning trees , 2016, STOC.

[30]  Ali Mashreghi,et al.  Time-communication trade-offs for minimum spanning tree construction , 2017, ICDCN.