A polynomial time approximation scheme for the two-source minimum routing cost spanning trees

Journal of Algorithms

Volumn 44, Issue 2, 2002, Pages 359-378

  Wu, Bang Ye ^a  

^a SHU TE UNIVERSITY   (Taiwan)

Author keywords

Approximation algorithms; NP hard; PTAS; Spanning trees

Indexed keywords

COMPUTATIONAL COMPLEXITY; POLYNOMIAL APPROXIMATION; PROBLEM SOLVING; TIME DOMAIN ANALYSIS; TREES (MATHEMATICS);

APPROXIMATION ALGORITHM; MINIMUM ROUTING COST SPANNING TREES; POLYNOMIAL TIME APPROXIMATION;

ALGORITHMS;

EID: 0036701992     PISSN: 01966774     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0196-6774(02)00205-5     Document Type: Article

References (12)

1. T.H. Cormen, C.E. Leiserson, R.L. Rivest, Introduction to Algorithms, MIT Press, 1994.
2. E.W. Dijkstra, A note on two problems in connexion with graphs, Numer. Math. 1 (1959) 269-271.
3. M.R. Garey, D.S. Johnson, Computers and Intractability: A Guide to the Theory of NP-Completeness, Freeman, San Francisco, 1979.
4. T.C. Hu, Optimum communication spanning trees, SIAM J. Comput. 3 (1974) 188-195.
5. D.S. Johnson, J.K. Lenstra, A.H.G. Rinnooy Kan, The complexity of the network design problem, Networks 8 (1978) 279-285.
6. R.M. Karp, Reducibility among combinatorial problems, in: R.E. Miller, J.W. Thatcher (Eds.), Complexity of Computer Computations, Plenum Press, New York, 1972, pp. 85-103.
7. M. Thorup, Undirected single source shortest paths with positive integer weights in linear time, J. ACM 46 (1999) 362-394.
8. R. Wong, Worst-case analysis of network design problem heuristics, SIAM J. Algebraic Discrete Math. 1 (1980) 51-63.
9. B.Y. Wu, K.M. Chao, C.Y. Tang, Approximation algorithms for the shortest total path length spanning tree problem, Discrete Appl. Math. 105 (2000) 273-289.
10. 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. 29 (2000) 761-778.
11. B.Y. Wu, K.M. Chao, C.Y. Tang, Approximation algorithms for some optimum communication spanning tree problems, Discrete Appl. Math. 102 (2000) 245-266.
12. B.Y. Wu, K.M. Chao, C.Y. Tang, A polynomial time approximation scheme for optimal product-requirement communication spanning trees, J. Algorithms 36 (2000) 182-204.