Approximation algorithms for some optimum communication spanning tree problems

Discrete Applied Mathematics

Volumn 102, Issue 3, 2000, Pages 245-266

  Wu, Bang Ye ^a   Chao, Kun Mao ^b   Tang, Chuan Yi ^c  

^a CHUNG SHAN INSTITUTE OF SCIENCE AND TECHNOLOGY   (Taiwan)

^b NATIONAL YANG MING UNIVERSITY   (Taiwan)

^c NATIONAL TSING HUA UNIVERSITY   (Taiwan)

Author keywords

Approximation algorithms; Network design; Spanning trees

Indexed keywords

EID: 0011249280     PISSN: 0166218X     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0166-218X(99)00212-7     Document Type: Article

References (8)

1. T.H. Cormen, C.E. Leiserson, R.L. Rivest, Introduction to Algorithms, MIT Press, Cambridge, MA, 1994.
2. M.R. Garey, D.S. Johnson, Computers and Intractability: A Guide to the Theory of NP-Completeness, W.H. Freeman and Company, San Francisco, 1979.
3. Hu T.C. Optimum communication spanning trees. SIAM J. Comput. 3(3):1974;188-195.
4. Johnson D.S., Lenstra J.K., Rinnooy Kan A.H.G. The complexity of the network design problem. Networks. 8:1978;279-285.
5. R.E. Tarjan, Data Structures and Network Algorithms, SIAM Press, Philadelphia, PA, 1983.
6. Wong R. Worst-case analysis of network design problem heuristics. SIAM J. Algebraic Discrete Math. 1:1980;51-63.
7. B.Y. Wu, G. Lancia, V. Bafna, K.M. Chao, R. Ravi, C.Y. Tang, A polynomial time approximation scheme for minimum routing cost spanning trees, SIAM J. Comput. in press. (A preliminary version of this paper appears in the Proceedings of the Ninth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA'98), 1998, pp. 21-32.).
8. B.Y. Wu, G. Lancia, V. Bafna, K.M. Chao, R. Ravi, C.Y. Tang, A polynomial time approximation scheme for minimum routing cost spanning trees, SIAM J. Comput. in press. (A preliminary version of this paper appears in the Proceedings of the Ninth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA'98), 1998, pp. 21-32.).