An approximation scheme for some Steiner tree problems in the plane

We design a polynomial time approximation scheme for the Steiner tree problem in the plane when the given set of regular points is c-local. The construction works for both Euclidean and rectilinear metrics.

[1]  Tao Jiang,et al.  Aligning sequences via an evolutionary tree: complexity and approximation , 1994, STOC '94.

[2]  Dana S. Richards,et al.  Steiner tree problems , 1992, Networks.

[3]  Q. Feng,et al.  On better heuristic for Euclidean Steiner minimum trees , 1991, [1991] Proceedings 32nd Annual Symposium of Foundations of Computer Science.

[4]  Stephen A. Vavasis,et al.  Automatic Domain Partitioning in Three Dimensions , 1991, SIAM J. Sci. Comput..

[5]  Ding-Zhu Du,et al.  An approach for proving lower bounds: solution of Gilbert-Pollak's conjecture on Steiner ratio , 1990, Proceedings [1990] 31st Annual Symposium on Foundations of Computer Science.

[6]  J. H. Lint.  Concrete mathematics : a foundation for computer science / R.L. Graham, D.E. Knuth, O. Patashnik , 1990 .

[7]  Marshall W. Bern,et al.  Two probabilistic results on rectilinear steiner trees , 1986, STOC '86.

[8]  János Komlós,et al.  Probabilistic partitioning algorithms for the rectilinear steiner problem , 1985, Networks.

[9]  Wolfgang Maass,et al.  Approximation schemes for covering and packing problems in image processing and VLSI , 1985, JACM.

[10]  Richard M. Karp,et al.  Probabilistic Analysis of Partitioning Algorithms for the Traveling-Salesman Problem in the Plane , 1977, Math. Oper. Res..

[11]  David S. Johnson,et al.  The Complexity of Computing Steiner Minimal Trees , 1977 .

[12]  David S. Johnson,et al.  The Rectilinear Steiner Tree Problem is NP Complete , 1977, SIAM Journal of Applied Mathematics.

[13]  F. Hwang.  On Steiner Minimal Trees with Rectilinear Distance , 1976 .