Abstract
Let G = (V, E, w) be an undirected graph with nonnegative edge weight. For any spanning tree T of G, the weight of T is the total weight of its tree edges and the routing cost of T is ∑ u, v∈V d T (u, v), where d T (u, v) is the distance between u and v on T. In this paper, we present an algorithm providing a trade off among tree weight, routing cost and time complexity. For any real number α > 1 and an integer 1 < k < 6α - 3, in O(n k+1+n 3) time, the algorithm finds a spanning tree whose routing cost is at most (1 + 2/(k + 1)) α times the one of the minimum routing cost tree, and the tree weight is at most (f(k) + 2/(α - 1)) times the one of the minimum spanning tree, where f(k) = 1 if k = 1 and f(k) = 2 if k > 1.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
I. Althöfer, G. Das, D. Dobkin, D. Joseph, and J. Soares, On sparse spanners of weighted graphs, Discrete and Computational Geometry, 9(1):81–100, 1993.
T.H. Cormen, C.E. Leiserson, and R.L. Rivest, Introduction to Algorithms, the MIT Press, 1994.
M. L. Fredman and R. E. Tarjan, Fibonacci heaps and their uses in improved network optimization algorithms, J. of the ACM, 34(3):596–615, 1987.
M.R. Garey and D.S. Johnson, Computers and Intractability: A Guide to the Theory of NP-Completeness, W.H. Freeman and Company, San Francisco, 1979.
T. C. Hu, Optimum communication spanning trees, SIAM J. Computing, 3(3):188–195, 1974.
D.S. Johnson, J.K. Lenstra, and A.H.G. Rinnooy Kan, The complexity of the network design problem, Networks, 8:279–285, 1978.
S. Khuller, B. Raghavachari, and N. Young, Balancing minimum spanning trees and shortest-path trees, Algorithmica, 14:305–321, 1995.
R. Wong, Worst-case analysis of network design problem heuristics. SIAM J. Algebraic Discrete Mathematics, 1:51–63, 1980.
B. Y. Wu, G. Lancia, V. Bafna, K. M. Chao, R. Ravi, and C. Y. Tang, A polynomial time approximation scheme for minimum routing cost spanning trees, Proceedings of Ninth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA’98), pp. 21–32, 1998.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1999 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Wu, B.Y., Chao, KM., Tang, C.Y. (1999). Constructing Light Spanning Trees with Small Routing Cost. In: Meinel, C., Tison, S. (eds) STACS 99. STACS 1999. Lecture Notes in Computer Science, vol 1563. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-49116-3_31
Download citation
DOI: https://doi.org/10.1007/3-540-49116-3_31
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-65691-3
Online ISBN: 978-3-540-49116-3
eBook Packages: Springer Book Archive