A Sausage heuristic for Steiner minimal trees in three-dimensional euclidean space

Journal of Mathematical Modelling and Algorithms

Volumn 4, Issue 2, 2005, Pages 199-217

  Toppur, Badri ^a   Smith, J MacGregor ^b  

^a T A PAI MANAGEMENT INSTITUTE   (India)

^b UNIVERSITY OF MASSACHUSETTS   (United States)

Author keywords

Computational geometry; Heuristics

Indexed keywords

EID: 21244445814     PISSN: 15701166     EISSN: None     Source Type: Journal    
DOI: 10.1007/s10852-004-6390-x     Document Type: Article

References (18)

1. Barber, B., Dobkin, D. P. and Huhdanpaa, H.: The quickhull algorithm for convex hulls, ACM Trans. on Math. Software 22(4) (1996), 469-483.
2. Courant, R. and Robbins, H.: What is Mathematics?, Oxford University Press, New York, 1941.
3. Coxeter, H. S. M.: Introduction to Geometry, Wiley, 1961.
4. Du, D. Z. and Smith, W. D.: Disproofs of generalized Gilbert-Pollak conjecture on the Steiner ratio in three or more dimensions, J. Combin. Theory Ser. A 74 (1996), 115-130.
5. Du, D. Z. and Hwang, F. K.: A proof of the Gilbert-Pollak conjecture on the Steiner ratio, Algorithmica 7 (1992), 121-135.
6. Fortune, S. J.: Voronoi diagrams and Delaunay triangulations, in D. Z. Du and F. K. Hwang (eds), Computing in Euclidean Geometry, World Scientific, Singapore, 1992, pp. 193-233.
7. Garey, M. R., Graham, R. L. and Johnson, D. S.: The complexity of computing Steiner minimal trees, SIAM J. Appl. Math. 32(4) (1977), 835-859.
8. Garey, M. R. and Johnson, D. S.: Computers and Intractability; A Guide to the Theory of NP-Completeness, W. H. Freeman, San Francisco, 1979.
9. Gilbert, E. N. and Pollak, H. O.: Steiner minimal trees, SIAM J. Appl. Math. 16 (1968), 1-29.
10. Kruskal, J. B.: On the shortest spanning subtree of a graph and the TSF, Proc. Amer. Math. Soc. (1956), 48-50.
11. Melzak, Z. A.: On the problem of Steiner, Canad. Math. Bull. 4 (1961), 143-148.
12. Prim, R. C.: Shortest connection networks and some generalizations, Bell System Tech. J. 36 (1957), 1389-1401.
13. 2) heuristic for Steiner minimal trees in E3, Networks 25 (1995), 273-289.
14. Smith, W. D.: How to find Steiner minimal trees in Euclidean d-space, Algorithmica 7 (1992), 137-177.
15. Smith, W. D. and MacGregor Smith, J.: On the Steiner ratio in 3-space, J. Combin. Theory (1995).
16. Tarjan, R. E.: Data Structures and Network Algorithms, CBMS-NSF Regional Conference Series in Applied Mathematics 44, SIAM, Philadelphia, PA, 1983.
17. Warme, D. M., Winter, P. and Zachariasen, M.: Exact algorithms for plane Steiner tree problems: A computational study, in D. Z. Du, J. M. Smith and J. H. Rubinstein (eds), Advances in Steiner Trees, Kluwer Academic Publishers, 2000, pp. 81-116.
18. Winter, P.: Steiner problem in networks: A survey, Networks 17 (1987), 129-167.