A nearly best-possible approximation algorithm for node-weighted steiner trees

Journal of Algorithms

Volumn 19, Issue 1, 1995, Pages 104-115

  Klein, Philip ^a   Ravi, R ^b  

^a BROWN UNIVERSITY   (United States)

^b PRINCETON UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

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

References (25)

1. A. Agrawai, P. Kllin, and R. Ravi, When trees collide: An approximation algorithm for the generalized Steiner tree problem on networks, in "Proceedings of the 23rd Annual ACM Symposium on Theory of Computing, 1991, " pp. 134-144.
2. P. Bkrman, personal communication, 1991.
3. V. Chvatal., A greedy heuristic for the set-covering problem. Math. Oper. Res. 4 (3) (1979), 233-235.
4. S. E. Drryfus and R. A. Wacincr, The Steiner problem in graphs, Networks 1 (1971), 195-207.
5. j. Edmonds and E. L. Johnson, Matching, Euler tours and the Chinese postman, Math. Programming 5 (1973), 88-124.
6. M. X. Gokmans and D. P. Williamson, A general approximation technique for constrained forest problems, in "Proceedings of the Third Annual ACM SI AM Symposium on Discrete Algorithms, 1992, " pp. 307-316.
7. S. L. Hakimi, Steiner's problem in graphs and its implications, Networks 1 (1971), 113-133.
8. F. K. Hwang and D. S. Richards, Steiner tree problems, Networks 22 (1) (1992), 55-90.
9. D. S. Johnson, Approximation algorithms for combinatorial problems, J. Comput. System Sci. 9 (1974), 256-278.
10. L. Kou, G. Markowsky, and L. Berman, A fast algorithm for Steiner trees, Acta Inform. IS (1981), 141-145.
11. F. T. Leighton and S. Rag, An approximate max-flow min-cut theorem for uniform multicommodity flow problems with application to approximation algorithms, in "Proceedings of the 29th Annual IEEE Conference on Foundations of Computer Science, 1988, " pp. 422-431.
12. L. Lovasz, On the ratio of optimal integral and fractional covers, Discrete Math. 13 (1975), 383-390.
13. C. Lund and M. Yannakakis, On the hardness of approximating minimization problems, in "Proceedings, 25th Annual ACM Symposium on the Theory of Computing, 1993."
14. K. Mehlhorn, A faster approximation algorithm for the Steiner problem in graphs, Inform. Process. Lett. 27 (3) (1988), 125-128.
15. J. Plesnik, A bound for the Steiner tree problem in graphs, Math. Slovaca 31 (1981), 155-163.
16. R. Ravi, M. V. Marathe, S. S. Ravi, D. J. Rosenkrantz, and H. B. Hunt III, Many birds with one stone: Multi-objective approximation algorithms, in "Proceedings, 25th Annual ACM Symposium on the Theory of Computing, 1993, " pp. 438-447.
17. V. J. Rayward-Smith, The computation of nearly minimal Steiner trees in graphs, Internal. J. Math. Ed. Sci. Tech. 14 (1) (1983), 15-23.
18. V. J. Rayward-Smith and A. Clare, On finding Steiner vertices, Networks 16 (1986), 283-294.
19. G. Reich and P. Widmayer, Beyond Steiner's problem: A VLSI oriented generalization, in "Proceedings, 15th International Workshop on Graph-Theoretic Concepts in Computer Science, 1989, " pp. 196-210.
20. A. Segkv, The node-weighted Steiner tree problem, Networks 17 (1987), pp. 1-17.
21. H. Takahashi and A. Matsuyama, An approximate solution for the Steiner problem in graphs, Math Japon. 24 (1980), 573-577.
22. P. Winter, Steiner problem in networks: A survey, BIT 25 (1985), 485-496.
23. L. Wolsey, personal communication, May 1993.
24. Y. F. Wu, P. Widmayer, and C. K. Wong, A faster approximation algorithm for the Steiner problem in graphs, Acta Inform. 23 (1986), 321-331.
25. A. Z. Zeukovsky, The 11/6-approximation algorithm for the Steiner problem on networks, Algorithmica 9 (1993), 463-470.