Abstract
Let G = (V, E,w) be an undirected graph with nonnegative edge weight w, and r be a nonnegative vertex weight. The productrequirement optimum communication spanning tree (PROCT) problem is to find a spanning tree T minimizing Σi,j∈V r(i)r(j)d(T, i, j), where d(T, i, j) is the distance between i and j on T. The sum-requirement optimum communication spanning tree (SROCT) problem is to minimize Σ i,j∈V (r(i) + r(j))d(T, i, j). Both the two problems are special cases of the general optimum communication spanning tree problem, and are generalizations of the shortest total path length spanning tree problem. In this paper, we present an O(n5) time 1.577-approximation algorithm for the PROCT problem, and an O(n3) time 2-approximation algorithm for the SROCT problem, where n is the number of vertices.
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
T.H. Coremen, C.E. Leiserson, and R.L. Rivest, Introduction to Algorithm, the MIT Press, 1994.
M.R. Garey and D.S. Johnson, Computers and Intractability: A Guide to the Theory of NP-Completeness, W.H. Freeman and Company, San Fransisco, 1979.
T. C. Hu, Optimum communication spanning tree, 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.
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, 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
© 1998 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Wu, B.Y., Chao, KM., Tang, C.Y. (1998). Approximation Algorithms for Some Optimum Communication Spanning Tree Problems. In: Chwa, KY., Ibarra, O.H. (eds) Algorithms and Computation. ISAAC 1998. Lecture Notes in Computer Science, vol 1533. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-49381-6_43
Download citation
DOI: https://doi.org/10.1007/3-540-49381-6_43
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-65385-1
Online ISBN: 978-3-540-49381-5
eBook Packages: Springer Book Archive