The local steiner problem in normed planes

Networks

Volumn 36, Issue 2, 2000, Pages 104-113

  Swanepoel, Konrad J ^a  

^a UNIVERSITY OF PRETORIA   (South Africa)

Author keywords

Minkowski planes; Normed planes; Steiner minimal trees; Steiner minimum trees; Steiner trees

Indexed keywords

EID: 0034259949     PISSN: 00283045     EISSN: None     Source Type: Journal    
DOI: 10.1002/1097-0037(200009)36:2<104::AID-NET5>3.0.CO;2-K     Document Type: Article

References (27)

1. 2, Pac J Math 149 (1991), 201-210.
2. [2] S. Arora, Polynomial time approximation schemes for Euclidean traveling salesman and other geometric problems, J ACM 45 (1998), 753-782.
3. [3] D. Cieslik, "The vertex-degrees of Steiner minimal trees in Minkowski planes," Topics in combinatorics and graph theory, R. Bodendiek and R. Henn (Editors). Physica-Verlag, Heidelberg, 1990, pp. 201-206.
4. [4] D. Cieslik, Steiner minimal trees, nonconvex optimization and its applications, Kluwer, Dordrecht, 1998, Vol. 23.
5. [5] E.J. Cockayne, On the Steiner problem, Can Math Bull 10 (1967), 431-450.
6. [6] R. Courant and H. Robbins, What is mathematics? Oxford University Press, Oxford, 1941.
7. [7] D.-Z. Du, B. Gao, R.L. Graham, Z.-C. Liu, and P.-J. Wan, Minimum Steiner trees in normed planes, Discr Comput Geom 9 (1993), 351-370.
8. [8] R. Durier and C. Michelot, Geometrical properties of the Fermat-Weber problem, Eur J Oper Res 20 (1985), 332-343.
9. [9] U. Fößmeier and M. Kaufmann, Solving rectilinear Steiner tree problems exactly in theory and practice, Proc 5th Ann European Symp on Algorithms, Gerhard Woeginger (Editor), Lecture Notes in Computer Science, Vol. 1284, Springer-Verlag, Verlin, 1997, pp. 171-185.
10. [10] M.R. Garey, R.L. Graham, and D.S. Johnson, The complexity of computing Steiner minimal trees, SIAM J Appl Math 32 (1977), 835-839.
11. [11] M.R. Garey and D.S. Johnson, The rectilinear Steiner tree problem is NP-complete, SIAM J Appl Math 32 (1977), 826-834.
12. [12] E.N. Gilbert and H.O. Pollak, Steiner minimal trees, SIAM J Appl Math 16 (1968), 1-29.
13. [13] M. Hanan, On Steiner's problem with rectilinear distance, SIAM J Appl Math 14 (1966), 255-265.
14. [14] F.K. Hwang, D.S. Richards, and P. Winter, The Steiner tree problem, Annuals of Discrete Mathematics, Vol. 53, North-Holland, Amsterdam, 1992.
15. [15] A.O. Ivanov and A.A. Tuzhilin, Minimal networks - the Steiner problem and its generalizations. CRC Press, Boca Raton, FL, 1994.
16. [16] B. Korte, H.J. Prömel, and A. Steger, "Steiner trees in VLSI-layout," Paths, flows, and VLSI-layout, B. Korte, L. Lovász, H.J. Prömel, A. Schrijuer (Editors), Algorithms and Combinatorics, Vol. 9, Springer-Verlag, Berlin, 1990, pp. 185-214.
17. [17] Y.S. Kupitz and H. Martini, "Geometric aspects of the generalized Fermat-Torricelli problem," Intuitive geometry, Bolyai Society Mathematical Studies, Budapest, 1997, Vol. 6, pp. 55-127.
18. [18] G.R. Lawlor and F. Morgan, Paired calibrations applied to soap films, immiscible fluids, and surfaces and networks minimizing other norms, Pac J Math 166 (1994), 55-82.
19. [19] D.T. Lee and C.-F. Shen, The Steiner minimal tree problem in the λ-geometry plane, Proc 7th Int Symp on Algorithms and Computation, T. Asano, Y. Igarashi, H. Nagamochi, S. Miyano, S. Suri. (Editors), Lecture Notes in Computer Science, Vol. 1178, Springer-Verlag, Berlin, 1996, pp. 247-255.
20. [20] D.T. Lee, C.-F. Shen, and C.L. Ding, On Steiner tree problem with 45° routing, 1995 Int Conf on Circuits and Systems, IEEE, 1995, pp. 1680-1683.
21. 3 metric, IEEE Trans Circuits Syst II 45 (1998), 563-574.
22. 4-geometry plane, 1998 Int Symp on Algorithms and Computation, Lecture Notes in Computer Science, Vol. 1533, Springer-Verlag, Berlin, 1998, pp. 327-336.
23. [23] G.-H. Lin, G.L. Xue, and D. Zhou, Approximating hexagonal Steiner minimal trees by fast optimal layout of minimum spanning trees, 1999 Int Conf on Computer Design, IEEE, 1999, pp. 392-398.
24. [24] Z.A. Melzak, On the problem of Steiner, Can Math Bull 4 (1961), 143-148.
25. [25] M. Sarrafzadeh and C.K. Wong, Hierarchical Steiner tree construction in uniform orientations, IEEE Trans Comput Aided Design 11 (1992), 1095-1103.
26. [26] A.C. Thompson, Minkowski geometry, encyclopedia of mathematics and its applications 63, Cambridge University Press, Cambridge, 1996.
27. [27] P. Winter and M. Zachariasen, Euclidean Steiner minimum trees: an improved exact algorithm, Networks 30 (1997), 149-166.