A faster distributed protocol for constructing a minimum spanning tree

Journal of Computer and System Sciences

Volumn 72, Issue 8, 2006, Pages 1282-1308

  Elkin, Michael ^a  

^a Yale University   (United States)

Author keywords

Distributed computing; Minimum spanning tree

Indexed keywords

ALGORITHMS; DISTRIBUTED COMPUTER SYSTEMS; PROBLEM SOLVING; SET THEORY; TREES (MATHEMATICS);

DISTRIBUTED COMPUTING; DISTRIBUTED PROTOCOLS; MINIMUM SPANNING TREE;

NETWORK PROTOCOLS;

EID: 33750431054     PISSN: 00220000     EISSN: 10902724     Source Type: Journal    
DOI: 10.1016/j.jcss.2006.07.002     Document Type: Article

References (28)

1. Awerbuch B. Complexity of network synchronization. J. ACM 4 (1985) 804-823
2. B. Awerbuch, Optimal distributed algorithms for minimum weight spanning tree, counting, leader election and related problems, in: Proc. 19th ACM Symp. on Theory of Computing, May 1987, pp. 230-240
3. B. Awerbuch, Distributed shortest paths algorithms, in: Proc. 21st ACM Symp. on Theory of Computing, May 1989, pp. 230-240
4. B. Awerbuch, B. Berger, L. Cowen, D. Peleg, Near-linear cost sequential and distributed constructions of sparse neighborhood covers, in: Proc. 34th IEEE Symp. on Foundations of Computer Science, 1993, pp. 638-647
5. Awerbuch B., Berger B., Cowen L., and Peleg D. Fast distributed network decompositions and covers. J. Parallel Distr. Comp. 39 2 (1996) 105-114
6. B. Awerbuch, A. Goldberg, M. Luby, S. Plotkin, Network decomposition and locality in distributed computation, in: Proc. 30th IEEE Symp. on Foundations of Computer Science, 1989, pp. 364-369
7. B. Awerbuch, D. Peleg, Network synchronization with polylogarithmic overhead, in: 31st IEEE Symp. on Foundations of Computer Science, October 1990, pp. 514-522
8. B. Awerbuch, D. Peleg, Efficient distributed construction of sparse covers, Technical report CS90-17, The Weizmann Institute of Science, Rehovot, Israel, July 1990
9. Awerbuch B., and Peleg D. Routing with polynomial communication-space tradeoff. SIAM J. Discrete Math. 5 (1992) 151-162
10. Alon N., and Spencer J.H. The Probabilistic Method (1992), Wiley p. 239
11. F. Chin, H.F. Ting, An almost linear time and O (n log n + e) messages distributed algorithm for minimum-weight spanning trees, in: Proc. 26th IEEE Symp. on Foundations of Computer Science, Los Alamitos, CA, 1985, pp. 257-266
12. E. Cohen, Fast Algorithms for constructing t-spanners and paths of stretch t, in: Proc. 34th IEEE Symp. on Foundations of Computer Science, IEEE, Piscataway, NJ, 1993, pp. 648-658
13. Dwork C., and Moses Y. Knowledge and common knowledge in a Byzantine environment: Crash failures. Inform. and Comput. 88 2 (October 1990) 156-186
14. M.L. Elkin, Computing almost shortest paths, in: Proc. 20th ACM Symp. on Principles of Distributed Computing, Newport, Rhode Island, August 2001, pp. 53-62
15. M.L. Elkin, Unconditional lower bounds on the time-approximation tradeoff for the distributed minimum spanning tree problem, manuscript, 2003
16. R. Fagin, A. Lotem, M. Naor, Optimal aggregation algorithms for middleware, in: Proc. 20th ACM Symp. on Principles of Database Systems, 2001, pp. 102-113
17. Gafni E. Improvements in the time complexity of two message-optimal election algorithms. Proc. 4th Symp. on Principles of Distributed Computing (1985), ACM, New York 175-185
18. Gallager R.G., Humblet P.A., and Spira P.M. A distributed algorithm for minimum-weight spanning trees. ACM Trans. Progr. Lang. Sys. 5 (1983) 66-77
19. Garay J.A., Kutten S., and Peleg D. A sublinear time distributed algorithm for minimum-weight spanning trees. SIAM J. Comput. 27 (1998) 302-316 preliminary version appeared
20. Garay J.A., Kutten S., and Peleg D. A sublinear time distributed algorithm for minimum-weight spanning trees. Proc. of 34th IEEE Symp. on Foundations of Computer Science. Palo Alto, CA (1993), IEEE Comput. Soc. Press, Los Alamitos, CA 659-668
21. Kutten S., and Peleg D. Fast distributed construction of k-dominating sets and applications. J. Algorithms 28 (1998) 40-66 preliminary version appeared, in: Proc. of 14th ACM Symp. on Principles of Distributed Computing, Ottawa, Canada, August 1995, pp. 20-27
22. Levin L.A. Universal search problems. Problemy Peredaci Informacii 9 (1973) 115-116 English translation:
23. Levin L.A. Universal search problems. Probl. Inf. Transm. 9 (1973) 265-266
24. Linial N. Locality in distributed graph algorithms. SIAM J. Comput. 21 (1992) 193-201
25. Linial N., and Saks M. Decomposing graphs into regions of small diameter. Proc. of the 2nd Symp. on Discrete Algorithms (1991), ACM 320-330
26. Peleg D. Distributed Computing: A Locality-Sensitive Approach (2000), SIAM, Philadelphia, PA
27. Peleg D. Distributed Computing: A Locality-Sensitive Approach (2000), SIAM, Philadelphia, PA pp. 273-275
28. Peleg D., and Rubinovich V. A near-tight lower bound on the time complexity of distributed MST construction. Proc. 40th IEEE Symp. on Foundations of Computer Science (1999) 253-261