An approximation scheme for some Steiner tree problems in the plane

Networks

Volumn 28, Issue 4, 1996, Pages 187-193

  Wang, Lusheng ^a,b   Jiang, Tao ^a  

^a MCMASTER UNIVERSITY   (Canada)

^b University of California Davis   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0038971681     PISSN: 00283045     EISSN: None     Source Type: Journal    
DOI: 10.1002/(SICI)1097-0037(199612)28:4<187::AID-NET3>3.0.CO;2-H     Document Type: Article

References (18)

1. P. Berman and V. Ramaiyer, Improved approximation for the Steiner tree problem, manuscript (1993).
2. M. W. Bern, Two probabilistic results on rectilinear Steiner trees. Algorithmica 3 (1988) 191-204.
3. P. Doyle and J. L. Snell, Random Graphs and Electric Networks. The Carus Mathematical Monographs, The Mathematical Association of America (1984).
4. D. Z. Du and F. K. Hwang, An approach for proving lower bounds: Solution of Gilbert-Pollak's conjecture on Steiner ratio. Proceedings of the 31st IEEE Foundation of Computer Science (1990) 76-85.
5. D. Z. Du, Y. Zhang, and Q. Feng, On better heuristic for Euclidean Steiner minimum trees. Proceedings of the 32nd IEEE Foundation of Computer Science (1991) 431-439.
6. M. R. Garey, R. L. Graham, and D. S. Johnson, The complexity of computing Steiner minimal trees. SIAM J. Appl. Math. 32 (1977) 835-859.
7. M. R. Garey and D. S. Johnson, The rectilinear Steiner tree problem is NP-complete. SIAM J. Appl. Math. 32 (1977) 826-834.
8. M. R. Garey and D. S. Johnson, Computers and Intractability: A Guide to the Theory of NP-Completeness. W. H. Freeman, San Francisco, CA (1979).
9. R. L. Graham, D. E. Knuth, and O. Patashnik, Concrete Mathematics - A Foundation for Computer Science, Addison-Wesley, Reading, MA (1989).
10. D. S. Hochbaum and W. Maass, Approximation schemes for covering and packing problems in image processing and VLSI. J. ACM 32 (1985) 130-136.
11. H. B. Hunt III, M. V. Marathe, V. Radhakrishnan, S. S. Ravi, D. J. Rosenkrantz, and R. E. Stearns, Efficient approximations and approximation schemes for geometric graphs, manuscript (1993).
12. F. K. Hwang, On Steiner minimal trees with rectilinear distance. SIAM. J. Appl. Math. 30 (1976) 104-114.
13. F. K. Hwang and D. S. Richards, Steiner tree problems. Networks 22 (1992) 55-89.
14. F. K. Hwang and Y. C. Yao, Comments on Bern's probabilistic results on rectilinear Steiner trees. Algorithmica 5 (1990) 591-598.
15. T. Jiang, E. L. Lawler, and L. Wang, Aligning sequences via an evolutionary tree: Complexity and approximation. Proceedings of the 26th ACM Symposium on Theory of Computing (1994).
16. R. M. Karp, Probabilistic analysis of partitioning algorithms for the traveling-salesman problem in the plane. Math. Oper. Res. 2 (1977) 209-224.
17. J. Komlos and M. T. Shing, Probabilistic partitioning algorithms for the rectilinear Steiner problem. Networks 15 (1985) 413-423.
18. S. A. Vavasis, Automatic domain partitioning in three dimensions. SIAM J. Sci. Stat. Comput. 12-4 (1991) 950-970.