Conversion of the Steiner problem on the Euclidean plane to the Steiner problem on graph

Automation and Remote Control

Volumn 66, Issue 10, 2005, Pages 1603-1613

  Lotarev, D T ^a   Uzdemir, A P ^a  

^a INSTITUTE FOR SYSTEMS ANALYSIS   (Russian Federation)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; GRAPH THEORY; PROBLEM SOLVING; TREES (MATHEMATICS);

EUCLIDEAN PLANES; STEINER PROBLEMS; STRUCTURAL SIMILARITY; TERMINAL VERTICES;

CONTROL SYSTEM ANALYSIS;

EID: 27144474459     PISSN: 00051179     EISSN: None     Source Type: Journal    
DOI: 10.1007/s10513-005-0194-y     Document Type: Article

References (11)

1. Gordeev, E.N. and Tarastsov, O.G., Steiner Problem. Review, Diskretn. Mat., 1993, vol. 5, no. 2, pp. 3-28.
2. Courant, R. and Robbins, H., What is Mathematics?, London: Oxford Univ. Press, 1941.
3. Translated under the title Chto takoe matematika?, Moscow: Prosveshchenie, 1967.
4. Lotarev, D.T., Suprun, A.V., and Uzdemir, A.P., Local Optimization in the Steiner Problem on the Euclidean Plane, Avtom. Telemekh., 2004, no. 7, pp. 60-70.
5. Garey, M.L. and Johnson, D.S., Computers and Intractability: A Guide to the Theory of NP-Completeness, San Francisco: Freeman, 1979.
6. Translated under the title Vychislitel'nye machiny i trudnoreshaemye zadachi, Moscow: Mir, 1982.
7. Lotarev, D.T. and Uzdemir, A.P., Arranging Transport Networks on a Nonuniform Territory, Avtom. Telemekh., 2002, no. 7, pp. 117-127.
8. Randazzo, C.D., Luna, H.P.L., and Mahey, P., Benders Decomposition for Local Access Network Design with Two Technologies, Discrete Math. Comput. Sci., 2001, vol. 4, pp. 235-246.
9. Voß, S., The Steiner Tree Problem with Hop Constraints, Ann. Oper. Res., 1999, vol. 86, pp. 321-345.
10. Christofides, N., Graph Theory. An Algorithmic Approach, New York: Academic, 1975.
11. Translated under the title Teoriya grafov. Algoritmicheskii podkhod, Moscow: Mir, 1978.