Steiner Minimum Trees in E3: Theory, Algorithms, and Applications
Author:
Smith J. MacGregor
Publisher
Springer New York
Reference87 articles.
1. B. Alberts, D. Bray, J. Lewis, K. Roberts, J. Watson, Molecular Biology of the Cell, 2nd edn. (Garland Publishing, New York, 1983)
2. A.A. Aly, D.C. Kay, D.W. Litwhiler, Location dominance on spherical surfaces. Oper. Res. 27, 972–981 (1979)
3. S. Arora, Polynomial time approximation scheme for Euclidean traveling salesman and other geometric problems. J. ACM 45, 753–782 (1998)
4. F. Aurenhammer, Voronoi diagrams – a survey of a fundamental geometric data structure. ACM Comput. Surv. 23, 345–405 (1991). Technical Report B-90-09, Department of Mathematics, Free University of Berlin (1990)
5. J.E. Beasley, A Greedy heuristic for the Euclidean and rectilinear Steiner problem. EJOR 58, 284–292 (1992)