Steiner minimum trees for equidistant points on two sides of an angle

Acta Cybernetica

Volumn 12, Issue 3, 1996, Pages 313-324

  Burkard, Rainer E ^a   Dudás, Tibor ^a  

^a GRAZ UNIVERSITY OF TECHNOLOGY   (Austria)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 3342992709     PISSN: 0324721X     EISSN: None     Source Type: Journal    
DOI: None     Document Type: Article

References (17)

1. R. E. Burkard, T. Dudás and T. Maier, Cut and Patch Steiner Trees for Ladders, SFB Report 12, Institut für Mathematik, TU Graz (1994), in Discrete Mathematics 162 (1996).
2. R. E. Burkard, T. Dudás and T. Maier, Cut and Patch Steiner Trees for Ladders, SFB Report 12, Institut für Mathematik, TU Graz (1994), in Discrete Mathematics 162 (1996).
3. F. R. K. Chung, M. Gardner and R.L. Graham, Steiner trees on a checkerboard, Mathematics Magazine 62 (1989), 83-96.
4. F. R. K. Chung and R. L. Graham, Steiner Trees for Ladders, Annals of Discrete Mathematics 2 (1978), 173-200.
5. E. J. Cockayne and D. E. Hewgill, Leaf paths of full Steiner trees and computation of planar Steiner minimal trees, Algorithmica 7 (1992), 219-229.
6. R. Courant and H. Robbins, What is Mathematics?, Oxford Univ. Press, New York (1941).
7. D. Z. Du and F. K. Hwang, Steiner minimal trees for bar waves, Acta Mathematicae Applicatae Sinica 3 (1987), 246-256.
8. D. Z. Du, F. K. Hwang and S. C. Chao, Steiner minimal trees for points on a circle, Proceedings of the American Mathematical Society 95 (1985), 613-618.
9. D. Z. Du, F. K. Hwang, G. D. Song and J. F. Weng, Steiner minimal trees on sets of four points, Discrete aad Computational Geometry 2 (1987), 401-414.
10. D. Z. Du, F. K. Hwang and J. F. Weng, Steiner minimal trees on zig-zag lines, Transactions of the American Mathematical Society 278 (1983), 149-156.
11. D. Z. Du, F. K. Hwang and J. F. Weng, Steiner minimal trees on regular polygons, Discrete and Computational Geometry 2 (1987), 65-87.
12. H. Edelsbrunner, Algorithms in Combinatorial Geometry, Berlin, Springer (1987).
13. M. R. Garey, R. L. Graham and D. S. Johnson, The complexity of computing Steiner minimal trees, SIAM J. Appl. Math. 32 (1977), 835-859.
14. F. K. Hwang and D. Z. Du, Steiner minimal trees on Chinese checkerboards, Mathematics Magazine 64 (1991), 332-339.
15. F. K. Hwang, D. S. Richards and P. Winter, The Steiner Tree Problem, Annals of Discrete Mathematics 53 (1992), Amsterdam, North-Holland, 3-10.
16. V. Jarnik and O. Kössler, O minimálních grafech obsahujících u daných bodu, Ĉas. Pêstováni Mat. 63 (1934) 223-235.
17. Z. A. Melzak, On the problem of Steiner, Canad. Math. Bull. 4 (1961), 143-148.