A fast distributed approximation algorithm for minimum spanning trees

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 4167 LNCS, Issue , 2006, Pages 355-369

  Khan, Maleq ^a   Pandurangan, Gopal ^a  

^a Purdue University   (United States)

Author keywords

Distributed approximation algorithm; Minimum spanning tree

Indexed keywords

APPROXIMATION THEORY; COMPUTATIONAL METHODS; COMPUTER NETWORKS; PARAMETER ESTIMATION; TREES (MATHEMATICS); WIRELESS TELECOMMUNICATION SYSTEMS;

ARBITRARY NETWORKS; DISTRIBUTED APPROXIMATION ALGORITHM; MINIMUM SPANNING TREE;

PARALLEL ALGORITHMS;

EID: 33845194110     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11864219_25     Document Type: Conference Paper

References (20)

1. Gallager, R., Humblet, P., Spira, P.: A distributed algorithm for minimum-weight spanning trees. ACM Transactions on Programming Languages and Systems 5(1) (1983) 66-77
2. Chin, F., Ting, H.: An almost linear time and O(n log n + e) messages distributed algorithm for minimum-weight spanning trees. In: Proc. 26th IEEE Symp. Foundations of Computer Science. (1985) 257-266
3. Gafni, E.: Improvements in the time complexity of two message-optimal election algorithms. In: Proc. of the 4th Symp. on Principles of Distributed Computing. (1985) 175-185
4. Awerbuch, B.: Optimal distributed algorithms for minimum weight spanning tree, counting, leader election, and related problems. In: Proc. 19th ACM Symp. on Theory of Computing. (1987) 230-240
5. Garay, J., Kutten, S., Peleg, D.: A sublinear time distributed algorithm for minimum-weight spanning trees. SIAM J. Comput. 27 (1998) 302-316
6. Kutten, S., Peleg, D.: Fast distributed construction of k-dominating sets and applications. J. Algorithms 28 (1998) 40-66
7. Elkin, M.: A faster distributed protocol for constructing minimum spanning tree. In: Proc. of the ACM-SIAM Symp. on Discrete Algorithms. (2004) 352-361
8. Peleg, D., Rabinovich, V.: A near-tight lower bound on the time complexity of distributed mst construction. In: Proc. of the 40th IEEE Symp. on Foundations of Computer Science. (1999) 253-261
9. Elkin, M.: Unconditional lower bounds on the time-approximation tradeoffs for the distributed minimum spanning tree problem. In: Proc. of the ACM Symposium on Theory of Computing. (2004) 331-340
10. Elkin, M.: An overview of distributed approximation. ACM SIGACT News Distributed Computing Column 35(4) (2004) 40-57
11. Peleg, D.: Distributed Computing: A Locality Sensitive Approach. SIAM (2000)
12. Korach, E., Moran, S., Zaks, S.: Optimal lower bounds for some distributed algorithms for a complete network of processors. Theoretical Computer Science 64 (1989) 125-132
13. Tel, G.: Introduction to Distributed Algorithms. Cambridge University Press (1994)
14. Khan, M., Kumar, V.A., Pandurangan, G.: A simple randomized scheme for constructing low-cost spanning subgraphs with applications to distributed algorithms. In: Technical Report, Dept. of Computer Science, Purdue University. (2005. http://www.cs.purdue.edu/homes/gopal/localmst.pdf)
15. Rosenkrantz, D., Stearns, R., Lewis, P.: An analysis of several heuristics for the traveling salesman problem. SIAM J. Comput. 6(3) (1977) 563-581
16. Imase, M., Waxman, B.: Dynamic steiner tree problem. Siam I. Discrete Math 4(3) (1991) 369-384
17. Korach, E., Moran, S., Zaks, S.: The optimality of distributive constructions of minimum weight and degree restricted spanning trees in a complete network of processors. SIAM Journal of Computing 16(2) (1987) 231-236
18. Lotker, Z., Patt-Shamir, B., Pavlov, E., Peleg, D.: Minimum-weight spanning tree construction in O(log log n) communication rounds. SIAM J. Comput. 35(1) (2005) 120-131
19. Lotker, Z., Patt-Shamir, B., Peleg, D.: Distributed mst for constant diameter graphs. In: Proc. of the 20th ACM Symp. on Principles of Distributed Computing. (2001) 63-72
20. Hoeffding, W.: Probability for sums of bounded random variables. J. of the American Statistical Association 58 (1963) 13-30