The k-Steiner ratio in graphs

SIAM Journal on Computing

Volumn 26, Issue 3, 1997, Pages 857-869

  Borchers, Al ^a   Du, Ding Zhu ^a  

^a University of Minnesota   (United States)

Author keywords

Approximation algorithms; Graph algorithms; Graph theory; Steiner ratio; Steiner trees

Indexed keywords

EID: 0010252474     PISSN: 00975397     EISSN: None     Source Type: Journal    
DOI: 10.1137/S0097539795281086     Document Type: Article

References (16)

1. P. BERMAN AND V. RAMAIYER, Improved approximation algorithms for the Steiner tree problem, J. Algorithms, 17 (1994), pp. 381-408.
2. M. BERN AND P. PLASSMANN, The Steiner problem with edge lengths 1 and 2, Inform. Process. Lett., 32 (1989), pp. 171-176.
3. D.-Z. DU AND F. K. HWANG, A proof of Gilbert and Pollak's conjecture on the Steiner ratio, Algorithmica, 7 (1992), pp. 121-135.
4. D.-Z. DU, Y.-J. ZHANG, AND Q. FENG, On better heuristic for Euclidean Steiner minimum trees, Proc. 32nd Annual IEEE Symposium on Foundations of Computer Science, IEEE Computer Society Press, Los Alamitos, CA, 1991, pp. 431-439.
5. D.-Z. DU, On component size bounded Steiner trees, Discrete Appl. Math., 60 (1995), pp. 131-140.
6. L. R. FOULDS AND R. L. GRAHAM, The Steiner problem in phylogeny is NP-complete, Adv. Appl. Math., 3 (1982), pp. 43-49.
7. M. R. GAREY, R. L. GRAHAM, AND D. S. JOHNSON, The complexity of computing Steiner minimal trees, SIAM J. Appl. Math., 32 (1977), pp. 835-859.
8. M. R. GAREY AND D. S. JOHNSON, The rectilinear Steiner tree problem is NP-complete, SIAM J. Appl. Math., 32 (1977), pp. 826-834.
9. E. N. GILBERT AND H. O. POLLAK, Steiner minimal trees, SIAM J. Appl. Math., 16 (1968), pp. 1-29.
10. R. L. GRAHAM AND F. K. HWANG, Remarks on Steiner minimal trees, Bull. Inst. Math. Acad. Sinica, 4 (1976), pp. 177-182.
11. F. K. HWANG, On Steiner minimal trees with rectilinear distance, SIAM J. Appl. Math., 30 (1976), pp. 104-114.
12. R. M. KARP, Reducibility among combinatorial problems, in Complexity of Computer Computation, R. E. Miller and J. W. Thatcher, eds., Plenum Press, New York, 1972, pp. 85-103.
13. M. KARPINSKI AND A. Z. ZELIKOVSKY, A new approach to approximation of Steiner trees, manuscript.
14. H. TAKAHASHI AND A. MATSUYAMA, An approximate solution for the Steiner problem in graphs, Math. Japon., 24 (1980), pp. 573-577.
15. A. Z. ZELIKOVSKY, The 11/6-approximation algorithm for the Steiner problem on networks, Algorithmica, 9 (1992), pp. 463-470.
16. A. Z. ZELIKOVSKY, Better approximation bounds for the network and Euclidean Steiner tree problems, manuscript.