An approximation scheme for some steiner tree problems in the plane

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 834 LNCS, Issue , 1994, Pages 414-422

  Jiang, Tao ^a   Wang, Lusheng ^a  

^a MCMASTER UNIVERSITY   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

POLYNOMIAL APPROXIMATION;

APPROXIMATION SCHEME; CONSTRUCTION WORKS; EUCLIDEAN; POLYNOMIAL TIME APPROXIMATION SCHEMES; REGULAR POINT; STEINER TREE PROBLEM;

TREES (MATHEMATICS);

EID: 21844481822     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-58325-4_206     Document Type: Conference Paper

References (17)

1. P. Berman and V. Ramalyer, “Improved approximation for the Steiner tree problem,” Manuscript, 1993.
2. M.W. Bern, “Two probabillstic results on rectilinear Steiner trees,” Algorithmica 3, pp. 191-204, 1988.
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,” Proc. 31st IEEE FOCS, pp. 76-85, 1990.
5. D.Z. Du, Y. Zhang and Q. Feng, “On better heuristic for Euclidean Steiner minimum trees,” IEEE, pp. 431-439, 1991.
6. M.R. Garey, R.L. Graham and D.S. Johnson, “The complexity of computing Steiner minimal trees,” SIAM J. APPL. MATH 82, 1977.
7. M.R. Garey and D.S. Johnson, “The rectilinear Steiner tree problem is NPcomplete,” SIAM J. APPL. MATH 82, pp. 826-834, 1977.
8. R.L. Graham, D.E. Knuth, and O. Patashnik, Concrete Mathematics - A Foundation for Computer Science, Addison-wesley publishing company, 1989.
9. D.S. Hochbaum and W. Maass, “Approximation schemes for covering and packing problems in image processing and VLSI,” J. ACM $2, pp. 130-136, 1985.
10. H.B. Hunt III, M.V. Marathe, V. Radhakrishnan, S.S. Ravi, D.J. Rosenkrantz, and R.F.. Stearns, “Efficient approximations and approximation schemes for geometric graphs,” Manuscript, 1993.
11. F.K. Hwang, “On Steiner minimal trees with rectilinear distance,” SIAM. J. APPL. MATH pp. 104-114, 1976.
12. F.K. Hwang and D.S. Richards, “Steiner tree problems,” Networks 22, pp. 55-89, 1992.
13. F.K. Hwang and Y.C. Yao, “Comments on Bern’s probabilistic results on rectilinear Steiner trees,” Algorithmica 5, pp. 591-598, 1990.
14. T. Jiang, E.L. Lawler and L. Wang, “Aligning sequences via an evolutionary tree:complexity and approximation,” to be presented at ~6th ACM Syrap. on Theory of Computing, 1994.
15. R.M. Karp, “Probabillstic analysis of partitioning algorithms for the travelingsalesman problem in the plane,” Mathematics of operations research 2, 1977.
16. J. Komlos and M.T. Shing, “Probabilistic partitioning algorithms for the rectilinear Steiner problem,” Networks 15, pp. 413-423, 1985.
17. S.A. Vavasis, “Automatic domain partitioning in three dimensions”, SIAM J. Sci. Star. Comput. 12-4, pp. 950-970, 1991.