Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
Skip to main content
Springer Nature Link
Log in

A fast distributed approximation algorithm for minimum spanning trees

  • Published:
Distributed Computing Aims and scope Submit manuscript

Abstract

We present a distributed algorithm that constructs an O(log n)-approximate minimum spanning tree (MST) in any arbitrary network. This algorithm runs in time Õ(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 exist graphs which need Ω(D(G) + L(G, w)) time to compute an H-approximation to the MST for any \(H\,\in\,[1, \Theta({\rm log} n)]\) . 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 Õ(D(G)) time.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. 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)

  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)

  3. Cormen T., Leiserson C. and Rivest R. (1990). Introduction to Algorithms. MIT Press, Cambridge

    Google Scholar 

  4. 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)

  5. Elkin M. (2004). An overview of distributed approximation. ACM SIGACT News Distrib. Comput. Column 35(4): 40–57

    Article  Google Scholar 

  6. 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)

  7. 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)

  8. Gallager R., Humblet P. and Spira P. (1983). A distributed algorithm for minimum-weight spanning trees. ACM Trans. Program. Lang. Syst. 5(1): 66–77

    Article  MATH  Google Scholar 

  9. Garay J., Kutten S. and Peleg D. (1998). A sublinear time distributed algorithm for minimum-weight spanning trees. SIAM J. Comput. 27: 302–316

    Article  MATH  MathSciNet  Google Scholar 

  10. Herlihy M., Kuhn F., Tirthapura S. and Wattenhofer R. (2006). Dynamic analysis of the arrow distributed protocol. Theory Comput. Syst. 39(6): 875–901

    Article  MATH  MathSciNet  Google Scholar 

  11. Hoeffding W. (1963). Probability for sums of bounded random variables. J. Am. Stat. Assoc. 58: 13–30

    Article  MATH  MathSciNet  Google Scholar 

  12. Imase M. and Waxman B. (1991). Dynamic steiner tree problem. Siam J. Discrete Math. 4(3): 369–384

    Article  MATH  MathSciNet  Google Scholar 

  13. Khan, M., Pandurangan, G., Kumar, V.: A simple randomized scheme for constructing low-weight k-connected spanning subgraphs with applications to distributed algorithms. Theor. Compu. Sci. 385(1–3): 101–114

  14. Korach E., Moran S. and Zaks S. (1987). The optimality of distributive constructions of minimum weight and degree restricted spanning trees in a complete network of processors. SIAM J. Comput. 16(2): 231–236

    Article  MATH  MathSciNet  Google Scholar 

  15. Korach E., Moran S. and Zaks S. (1989). Optimal lower bounds for some distributed algorithms for a complete network of processors. Theor. Comput. Sci. 64: 125–132

    Article  MATH  MathSciNet  Google Scholar 

  16. Kutten S. and Peleg D. (1998). Fast distributed construction of k-dominating sets and applications. J. Algorithms 28: 40–66

    Article  MATH  MathSciNet  Google Scholar 

  17. Lotker Z., Patt-Shamir B., Pavlov E. and Peleg D. (2005). Minimum-weight spanning tree construction in O(log log n) communication rounds. SIAM J. Comput. 35(1): 120–131

    Article  MATH  MathSciNet  Google Scholar 

  18. Lotker Z., Patt-Shamir B. and Peleg D. (2006). Distributed mst for constant diameter graphs. Distrib. Comput. 18(6): 453–460

    Article  Google Scholar 

  19. Lotker, Z., Pavlov, E., Patt-Shamir, B., Peleg, D.: Mst construction in o(log log n) communication rounds. In: Proc. of the 15th ACM Symposium on Parallel Algorithms and Architectures, pp. 94–100 (2003)

  20. Peleg, D.: Distributed computing: a locality sensitive approach. SIAM (2000)

  21. 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)

  22. Rosenkrantz D., Stearns R. and Lewis P. (1977). An analysis of several heuristics for the traveling salesman problem. SIAM J. Comput. 6(3): 563–581

    Article  MATH  MathSciNet  Google Scholar 

  23. Tel G. (1994). Introduction to Distributed Algorithms. Cambridge University Press, London

    Book  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, Purdue University, West Lafayette, IN, 47907, USA

    Maleq Khan & Gopal Pandurangan

Authors
  1. Maleq Khan
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Gopal Pandurangan
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Maleq Khan.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Khan, M., Pandurangan, G. A fast distributed approximation algorithm for minimum spanning trees. Distrib. Comput. 20, 391–402 (2008). https://doi.org/10.1007/s00446-007-0047-8

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00446-007-0047-8

Keywords

Search

Navigation