A Polynomial Time Approximation Scheme for Optimal Product-Requirement Communication Spanning Trees

Journal of Algorithms

Volumn 36, Issue 2, 2000, Pages 182-204

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

^a SHU TE UNIVERSITY   (Taiwan)

^b NATIONAL YANG MING UNIVERSITY   (Taiwan)

^c NATIONAL TSING HUA UNIVERSITY   (Taiwan)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0011243767     PISSN: 01966774     EISSN: None     Source Type: Journal    
DOI: 10.1006/jagm.2000.1088     Document Type: Article

References (11)

1. R. K. Ahuja, T. L. Magnanti, and J. B. Orlin, "Network Flows - Theory, Algorithms, and Applications," Prentice-Hall, Englewood Cliffs, NJ, 1993.
2. M. R. Garey and D. S. Johnson, "Computers and Intractability: A Guide to the Theory of NP-Completeness," Freeman, San Francisco, 1979.
3. T. C. Hu, Optimum communication spanning trees, SIAM J. Comput., 3 (1974), 188-195.
4. E. L. Lawler, Fast approximation algorithms for knapsack problems, Math. Oper. Res. 4, No. 4 (1979), 339-356.
5. R. Wong, Worst-case analysis of network design problem heuristics, SIAM J. Algebraic Discrete Math. 1 (1980), 51-63.
6. B. Y. Wu, K. M. Chao, and C. Y. Tang, Approximation algorithms for the shortest total path length spanning tree problem, Discrete Appl. Math., accepted for publication.
7. 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, SIAM J. Comput., accepted for publication. [A preliminary version of this paper appears in the "Proceedings of the Ninth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA'98)," pp. 21-32, ACM, New York, 1998].
8. 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, SIAM J. Comput., accepted for publication. [A preliminary version of this paper appears in the "Proceedings of the Ninth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA'98)," pp. 21-32, ACM, New York, 1998].
9. B. Y. Wu, K. M. Chao, and C. Y. Tang, Approximation algorithms for some optimum communication spanning tree problems, Discrete Appl. Math. 102 (2000), 245-266. [a partial result of this paper appeared in the "Proceedings of the Ninth Annual International Symposium on Algorithm and Computation (ISAAC'98)," Lecture Notes in Computer Science, Vol. 1533, pp. 407-416, Springer-Verlag, New York/Berlin, 1998].
10. B. Y. Wu, K. M. Chao, and C. Y. Tang, Approximation algorithms for some optimum communication spanning tree problems, Discrete Appl. Math. 102 (2000), 245-266. [a partial result of this paper appeared in the "Proceedings of the Ninth Annual International Symposium on Algorithm and Computation (ISAAC'98)," Lecture Notes in Computer Science, Vol. 1533, pp. 407-416, Springer-Verlag, New York/Berlin, 1998].
11. B. Y. Wu, K. M. Chao, and C. Y. Tang, Constructing light spanning trees with small routing cost, in "Proceedings of the 16th International Symposium on Theoretical Aspects of Computer Science (STACS'99)," Lecture Notes in Computer Science, Vol. 1563, pp. 334-344, Springer-Verlag, New York/Berlin, 1999.