Minimum networks for four points in space

Geometriae Dedicata

Volumn 93, Issue 1, 2002, Pages 57-70

  Rubinstein, J H ^a   Thomas, D A ^a   Weng, J ^a  

^a UNIVERSITY OF MELBOURNE   (Australia)

Author keywords

Minimum network; Steiner ratio; Steiner tree; Unslovability

Indexed keywords

EID: 0036386751     PISSN: 00465755     EISSN: None     Source Type: Journal    
DOI: 10.1023/A:1020389712969     Document Type: Article

References (22)

1. Cieslik, D.: Steiner Minimal Trees, Kluwer Acad. Publ., Dordrecht, 1998.
2. Courant, R. and Robbins, H.: What is Mathematics, Oxford Univ. Press, New York, 1941.
3. Du, D. Z., and Hwang, F. K.: A proof of Gilbert and Pollak's conjecture on the Steiner ratio, Algorithmica, 7 (1992), 121-135.
4. Du, D. Z., Hwang, F. K., Song, G. D. and Ting, G. Y.: Steiner minimal trees for four points, Discrete Comput. Geom. 2 (1987), 401-414.
5. Du, D. Z., Yao, E. Y. and Hwang, F. K.: A short proof of a result of Pollak on Steiner minimal trees, J. Combin. Theory Ser. A, 32 (1982), 396-400.
6. Du, X. F., Du, D. Z., Gao, B. and Lixue, Q.: A simple proof for a result of Ollerenshaw on Steiner trees, In: Advances in Optimization and Approximation, Nonconvex Optim. Appl. 1, Kluwer Acad. Publ., Dordrecht, 1994, pp. 68-71.
7. Hwang, F. K.: A linear time algorithm for full Steiner trees, Oper. Res. Lett. 5 (1986), 235-237.
8. Hwang, F. K. and Weng, J.F.: Hexagonal coordinate systems and Steiner minimal trees, Discrete Math. 62 (1986), 49-57.
9. Hwang, F. K., Richard, D. S. and Winter, P.: The Steiner Tree Problem, North-Holland, Amsterdam, 1992.
10. Kuhn, H. W.: 'Steiner's' problem revisited, In: G. B. Dantzig and B. C. Eaves (eds), Studies in Optimization, Math. Assoc. Amer., Washington, 1974, pp. 52-70.
11. Mehlhos, St.: Simple counter examples for the unsolvability of the Fermat- and Steiner-Weber-problem by compass and ruler, Contrib. Algebra Geom. 41 (2000), 151-158.
12. Melzak, Z. A.: On the Steiner problem, Canad. Math. Bull. 4 (1961), 143-148.
13. Ollerenshaw, K.: Minimum networks linking four points in a plane, Inst. Math. Appl. 15 (1978), 208-211.
14. Pollak, H. O.: Some results on the Steiner problem, J. Combin. Theory Ser. A 24 (1978), 278-295.
15. Rubinstein, J. H. and Thomas, D. A.: A variational approach to the Steiner network problem, Ann. Oper. Res. 33 (1991), 481-499.
16. Rubinstein, J. H. and Thomas, D. A.: The Steiner ratio conjecture for six points, J. Combin. Theory Ser. A 58 (1991), 54-77.
17. Rubinstein, J. H. and Thomas, D. A.: The Steiner ratio conjecture for cocircular points, J. Discrete Comput. Geom. 7 (1992), pp. 77-86.
18. Smith, W. D.: How to find Steiner minimal trees in Euclidean d-space, Algorithmica 7 (1992), 137-177.
19. Smith, W. D. and Smith, J. M.: On the Steiner ratio in 3D-space, J. Combin. Theory Ser. A 69 (1995), 301-332.
20. Weng, J. F.: Generalized Steiner problem and hexagonal coordinate system (in Chinese), Acta Math. Appl. Sinica 8 (1985), 383-397.
21. Weng, J. F.: Symmetrization theorem of full Steiner trees, J. Combin. Theory Ser. A 66 (1994), 185-191.
22. Weng, J. F.: Variational approach and Steiner minimal trees on four points, Discrete Math. 132 (1994), 349-362.