Approximation algorithms for the shortest total path length spanning tree problem

Discrete Applied Mathematics

Volumn 105, Issue 1-3, 2000, Pages 273-289

  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

[No Author keywords available]

Indexed keywords

EID: 0011188480     PISSN: 0166218X     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0166-218X(00)00185-2     Document Type: Article

References (12)

1. V. Bafna, E.L. Lawler, P. Pevzner, Approximation Algorithms for Multiple Sequence Alignment, Proceedings of the 5th Combinatorial Pattern Matching Conference, Lecture Notes in Computer Science, Vol. 807, Springer, Berlin, 1994, pp. 43-53.
2. Cormen T.H., Leiserson C.E., Rivest R.L. Introduction to Algorithms. 1994;MIT Press, Cambridge, MA.
3. Dionne R., Florian M. Exact and approximate algorithms for optimal network design. Networks. 9(1):1979;37-60.
4. Farach M., Kannan S., Warnow T. A robust model for finding optimal evolutionary trees. Algorithmica. 13:1995;155-179.
5. Garey M.R., Johnson D.S. Computers and Intractability: A Guide to the Theory of NP-Completeness. 1979;Freeman, San Francisco, CA.
6. Gusfield D. Efficient methods for multiple sequence alignment with guaranteed error bounds. Bull. Math. Biol. 55:1993;141-154.
7. Gusfield D. Algorithms on Strings, Trees, and Sequences: Computer Science and Computational Biology. 1997;Cambridge University Press, Cambridge.
8. Hu T.C. Optimum communication spanning trees. SIAM J. Comput. 3(3):1974;188-195.
9. Johnson D.S., Lenstra J.K., Rinnooy Kan A.H.G. The complexity of the network design problem. Networks. 8:1978;279-285.
10. Pevzner P. Multiple alignment, communication cost, and graph matching. SIAM J. Appl. Math. 52:1992;1763-1779.
11. Wong R. Worst-case analysis of network design problem heuristics. SIAM J. Algebraic Discrete Math. 1:1980;51-63.
12. 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, Proceedings of Ninth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA'98), 1998, pp. 21-32.