A PTAS for weight constrained Steiner trees in series-parallel graphs

Theoretical Computer Science

Volumn 304, Issue 1-3, 2003, Pages 237-247

  Chen, Guangting ^a   Xue, Guoliang ^b  

^a HANGZHOU DIANZI UNIVERSITY   (China)

^b Arizona State University   (United States)

Author keywords

Multiple constraints quality of service; Series parallel graphs; Steiner trees

Indexed keywords

ALGORITHMS; GRAPH THEORY; POLYNOMIAL APPROXIMATION; PROBLEM SOLVING; QUALITY OF SERVICE; TREES (MATHEMATICS);

STEINER TREES;

COMPUTER NETWORKS;

EID: 0037811195     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0304-3975(03)00088-4     Document Type: Article

References (18)

1. Arora S. Polynomial time approximation schemes for Euclidean traveling salesman and other geometric problems. J. ACM. 45:1998;753-782.
2. G.T. Chen, G.L. Xue, K-pair delay constrained minimum cost routing in undirected networks, SODA2001-ACM-SIAM Symp. on Discrete Algorithms, pp. 230-231.
3. Colbourn C.J., Xue G. Grade of service Steiner trees on a series-parallel network. Du D.-Z., Smith J.M., Rubinstein J.H. Advances in Steiner Trees. 2000;163-174 Kluwer Academic Publishers, Dordrecht.
4. D.Z. Du, F.K. Hwang, An approach for proving lower bounds: solution of Gilbert-Pollak conjecture on Steiner ratio, IEEE FOCS'90, pp. 76-85.
5. Farley A.M. Networks immune to isolated failures. Networks. 11:1981;255-268.
6. Garey M.R., Johnson D.S. Computers and Intractability: A Guide to the Theory of NP-Completeness. 1979;W.H Freeman and Company, San Francisco, CA.
7. Hassin R. Approximation schemes for the restricted shortest path problem. Math. Oper. Res. 17:1992;36-42.
8. Hwang F.K., Richards D.S., Winter Pawel The Steiner tree problem. Annals of Discrete Mathematics. vol. 53:1992;North-Holland, Amsterdam.
9. O. Ibarra, C. Kim, Fast approximation algorithms for the knapsack and sum of subsets problems, J. ACM 22 463-468.
10. X. Jia, L. Wang, Group multicast routing using multiple minimum Steiner trees, J. Comput. Commun. (1997) 750-758.
11. Jiang T., Wang L. Computing shortest networks under a fixed topology. Du D.-Z., Smith J.M., Rubinstein J.H. Advances in Steiner Trees. 2000;39-62 Kluwer Academic Publishers, Dordrecht.
12. Lorenz D.H., Raz D. A simple efficient approximation scheme for the restricted shortest path problem. Oper. Res. Lett. 28:2001;213-219.
13. Sahni S. General techniques for combinatorial approximations. Oper. Res. 35:1977;70-79.
14. Wald J.A., Colbourn C.J. Steiner trees, partial 2-trees, and minimum IFI networks. Networks. 13:1983;159-167.
15. Wang Z., Crowcroft J. Quality-of-service routing for supporting multimedia applications. IEEE J. Selected Areas Commun. 14:1996;1228-1234.
16. Winter P. Generalized Steiner problem in series-parallel networks. J. Algorithms. 7:1986;549-566.
17. G.L. Xue, G.H. Lin, D.Z. Du, Grade of service Steiner minimum trees in the Euclidean plane, Algorithmica, in press.
18. G.L. Xue, W. Xiao, An FPTAS for minimum cost delay constrained multicast tree under a Steiner topology, with applications, submitted for publication.