Algorithmica

, Volume 14, Issue 4, pp 305–321

Balancing minimum spanning trees and shortest-path trees

  • S. Khuller
  • B. Raghavachari
  • N. Young
Article

Abstract

We give a simple algorithm to find a spanning tree that simultaneously approximates a shortest-path tree and a minimum spanning tree. The algorithm provides a continuous tradeoff: given the two trees and aγ>0, the algorithm returns a spanning tree in which the distance between any vertex and the root of the shortest-path tree is at most 1+√2γ times the shortest-path distance, and yet the total weight of the tree is at most 1+√2/γ times the weight of a minimum spanning tree. Our algorithm runs in linear time and obtains the best-possible tradeoff. It can be implemented on a CREW PRAM to run a logarithmic time using one processor per vertex.

Key words

Minimum spanning trees Graph algorithms Parallel algorithms Shortest paths 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. [1]
    I. Althöfer, G. Das, D. Dobkin, D. Joseph, and J. Soares, On sparse spanners of weighted graphs,Discrete and Computational Geometry,9(1) (1993), 81–100.Google Scholar
  2. [2]
    B. Awerbuch, A. Baratz, and D. Peleg, Cost-sensitive anlaysis of communication protocols,Proc. 9th Symp. on Principles of Distributed Computing, 1990, pp. 177–187.Google Scholar
  3. [3]
    B. Awerbuch, A. Baratz, and D. Peleg, Efficient broadcast and light-weight spanners, Manuscript (1991).Google Scholar
  4. [4]
    K. Bharath-Kumar and J. M. Jaffe, Routing to multiple destinations in computer networks,IEEE Transactions on Communications,31(3) (1983), 343–351.Google Scholar
  5. [5]
    B. Chandra, G. Das, G. Narasimhan, and J. Soares, New sparseness results on graph spanners,Proc. 8th Symp. on Conputational Geometry, 1992, pp. 192–201.Google Scholar
  6. [6]
    L. P. Chew, There are planar graphs almost as good as the complete graph,Journal of Computer and System Sciences,39(2) (1989), 205–219.Google Scholar
  7. [7]
    J. Cong, A. B. Kahng, G. Robins, M. Sarrafzadeh, and C. K. Wong, Performance-driven global routing for cell based IC's,Proc. IEEE Internat. Conf. on Computer Design, 1991, pp. 170–173.Google Scholar
  8. [8]
    J. Cong, A. B. Kahng, G. Robins, M. Sarrafzadeh, and C. K. Wong, Provably good performance-driven global routing,IEEE Transactions on CAD, (1992), 739–752.Google Scholar
  9. [9]
    J. Cong, A. B. Kahng, G. Robins, M. Sarrafzadeh, and C. K. Wong, Provably good algorithms for performance-driven global routing,Proc. IEEE Internat. Symp. on Circuits and Systems, San Diego, 1992, pp. 2240–2243.Google Scholar
  10. [10]
    T. H. Cormen, C. E. Leiserson, and R. L. Rivest,Introduction to Algorithms, MIT Press, Cambridge, MA, 1989.Google Scholar
  11. [11]
    E. W. Dijkstra, A note on two problems in connexion with graphs,Numerische Mathematik,1 (1959), 269–271.Google Scholar
  12. [12]
    M. L. Freeman and R. E. Tarjan, Fibonacci heaps and their uses in improved network optimization algorithms,Journal of the ACM,34(3) (1987), 596–615.Google Scholar
  13. [13]
    H. N. Gabow, Z. Galil, T. Spencer, and R. E. Tarjan, Efficient algorithms for finding minimum spanning trees in undirected and directed graphs,Combinatorica,6(2) (1986), 109–122.Google Scholar
  14. [14]
    J. JáJáIntroduction to Parallel Algorithms, Addison-Wesley, Reading, MA, 1991.Google Scholar
  15. [15]
    J. B. Kruskal, On the shortest spanning subtree of a graph and the traveling salesman problem,Proceedings of the American Mathematical Society,7, (1956), pp. 48–50.Google Scholar
  16. [16]
    C. Levcopoulos and A. Lingas, There are planar graphs almost as good as the complete graphs and almost as cheap as minimum spanning trees,Algorithmica,8(3) (1992), 251–256.Google Scholar
  17. [17]
    D. Peleg and J. D. Ullman, An optimal synchronizer for the hypercube,Proc. 6th Symp. on Principles of Distributed Computing, 1987, pp. 77–85.Google Scholar
  18. [18]
    F. P. Preparata and M. I. Shamos,Computational Geometry, Springer-Verlag, New York, 1985.Google Scholar
  19. [19]
    R. C. Prim, Shortest connection networks and some generalizations,Bell System Technical Journal,36 (1957), 1389–1401.Google Scholar
  20. [20]
    P. M. Vaidya, A sparse graph almost as good as the complete graph on points inK dimensions,Discrete and Computational Geometry,6 (1991), 369–381.Google Scholar

Copyright information

© Springer-Verlag New York Inc. 1995

Authors and Affiliations

  • S. Khuller
    • 1
  • B. Raghavachari
    • 2
  • N. Young
    • 3
  1. 1.Department of Computer Science and Institute for Advanced Computer StudiesUniversity of MarylandCollege ParkUSA
  2. 2.Department of Computer ScienceUniversity of Texas at DallasRichardsonUSA
  3. 3.Department of Computer SciencePrinceton UniversityPrincetonUSA

Personalised recommendations