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. Translated under the title Chto takoe matematika?, Moscow: Prosveshchenie, 1967.
3. 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.
4. Garey, M.L. and Johnson, D.S., Computers and Intractability: A Guide to the Theory of NP-Completeness, San Francisco: Freeman, 1979. Translated under the title Vychislitel'nye machiny i trudnoreshaemye zadachi, Moscow: Mir, 1982.
5. Lotarev, D.T. and Uzdemir, A.P., Arranging Transport Networks on a Nonuniform Territory, Avtom. Telemekh., 2002, no. 7, pp. 117–127.