A Fast Distributed Approximation Algorithm for Minimum Spanning Trees

  • Maleq Khan
  • Gopal Pandurangan
Part of the Lecture Notes in Computer Science book series (LNCS, volume 4167)

Abstract

We give a distributed algorithm that constructs a O(logn)- approximate minimum spanning tree (MST) in arbitrary networks. Our algorithm runs in time \(\tilde{O}(D(G) + L(G,w))\) where L(G,w) is a parameter called the local shortest path diameter and D(G) is the (unweighted) diameter of the graph. Our algorithm is existentially optimal (up to polylogarithmic factors), i.e., there exists graphs which need Ω(D(G)+ L(G,w)) time to compute an H-approximation to the MST for any H ∈[1, Θ(logn)]. Our result also shows that there can be a significant time gap between exact and approximate MST computation: there exists graphs in which the running time of our approximation algorithm is exponentially faster than the time-optimal distributed algorithm that computes the MST. Finally, we show that our algorithm can be used to find an approximate MST in wireless networks and in random weighted networks in almost optimal \(\tilde{O}(D(G))\) time.

Keywords

Distributed Approximation Algorithm Minimum Spanning Tree 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Gallager, R., Humblet, P., Spira, P.: A distributed algorithm for minimum-weight spanning trees. ACM Transactions on Programming Languages and Systems 5(1), 66–77 (1983)MATHCrossRefGoogle Scholar
  2. 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, pp. 257–266 (1985)Google Scholar
  3. 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, pp. 175–185 (1985)Google Scholar
  4. 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, pp. 230–240 (1987)Google Scholar
  5. 5.
    Garay, J., Kutten, S., Peleg, D.: A sublinear time distributed algorithm for minimum-weight spanning trees. SIAM J. Comput. 27, 302–316 (1998)MATHCrossRefMathSciNetGoogle Scholar
  6. 6.
    Kutten, S., Peleg, D.: Fast distributed construction of k-dominating sets and applications. J. Algorithms 28, 40–66 (1998)MATHCrossRefMathSciNetGoogle Scholar
  7. 7.
    Elkin, M.: A faster distributed protocol for constructing minimum spanning tree. In: Proc. of the ACM-SIAM Symp. on Discrete Algorithms, pp. 352–361 (2004)Google Scholar
  8. 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, pp. 253–261 (1999)Google Scholar
  9. 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, pp. 331–340 (2004)Google Scholar
  10. 10.
    Elkin, M.: An overview of distributed approximation. ACM SIGACT News Distributed Computing Column 35(4), 40–57 (2004)CrossRefGoogle Scholar
  11. 11.
    Peleg, D.: Distributed Computing: A Locality Sensitive Approach. SIAM, Philadelphia (2000)MATHCrossRefGoogle Scholar
  12. 12.
    Korach, E., Moran, S., Zaks, S.: Optimal lower bounds for some distributed algorithms for a complete network of processors. Theoretical Computer Science 64, 125–132 (1989)MATHCrossRefMathSciNetGoogle Scholar
  13. 13.
    Tel, G.: Introduction to Distributed Algorithms. Cambridge University Press, Cambridge (1994)MATHCrossRefGoogle Scholar
  14. 14.
    Khan, M., Kumar, V.A., Pandurangan, G.: A simple randomized scheme for constructing low-cost spanning subgraphs with applications to distributed algorithms.Technical Report, Dept. of Computer Science, Purdue University (2005), http://www.cs.purdue.edu/homes/gopal/localmst.pdf
  15. 15.
    Rosenkrantz, D., Stearns, R., Lewis, P.: An analysis of several heuristics for the traveling salesman problem. SIAM J. Comput. 6(3), 563–581 (1977)MATHCrossRefMathSciNetGoogle Scholar
  16. 16.
    Imase, M., Waxman, B.: Dynamic steiner tree problem. Siam J. Discrete Math. 4(3), 369–384 (1991)MATHCrossRefMathSciNetGoogle Scholar
  17. 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), 231–236 (1987)MATHCrossRefMathSciNetGoogle Scholar
  18. 18.
    Lotker, Z., Patt-Shamir, B., Pavlov, E., Peleg, D.: Minimum-weight spanning tree construction in \(\textit{O}(\log \log n)\) communication rounds. SIAM J. Comput. 35(1), 120–131 (2005)MATHCrossRefMathSciNetGoogle Scholar
  19. 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, pp. 63–72 (2001)Google Scholar
  20. 20.
    Hoeffding, W.: Probability for sums of bounded random variables. J. of the American Statistical Association 58, 13–30 (1963)MATHCrossRefMathSciNetGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2006

Authors and Affiliations

  • Maleq Khan
    • 1
  • Gopal Pandurangan
    • 1
  1. 1.Department of Computer SciencePurdue UniversityWest LafayetteUSA

Personalised recommendations