The Steiner problem in graphs: Topological methods of solution

Automation and Remote Control

Volumn 65, Issue 3, 2004, Pages 439-448

  Panyukov, A V ^a  

^a SOUTH URAL STATE UNIVERSITY   (Russian Federation)

Author keywords

[No Author keywords available]

Indexed keywords

HIERARCHICAL DECOMPOSITION METHOD; STEINER PROBLEM; STEINER TREE; SUBGRAPHS;

ALGORITHMS; COMPUTATIONAL COMPLEXITY; FUNCTIONS; MATHEMATICAL MODELS; POLYNOMIALS; PROBLEM SOLVING; THEOREM PROVING;

GRAPH THEORY;

EID: 84904240202     PISSN: 00051179     EISSN: None     Source Type: Journal    
DOI: 10.1023/B:AURC.0000019376.31168.20     Document Type: Article

References (33)

1. Hwang, R.F., et al., The Steiner Tree Problem, New York: North Holland, 1992.
2. Mikhalevich, V.S., Trubin, V.S., and Shor, N.Z., Optimizatsionnye zadachi proizvodstvenno-transportnogo planirovaniya: modeli, metody, algoritmy (Optimal Production and Transport Planning: Models, Methods, and Algorithms), Moscow: Nauka, 1986.
3. Panyukov, A.V., Pelzwerger, B.V., and Shafir, A.Yu., Optimal Design and Control of Development of Oil and Gas Production Systems, Trudy IX Vsesoyuz. sov. probl. upr. (Proc. IX All Union Seminar on Control Problems), Moscow: Inst. Problem Upravlen., 1983, pp. 424-425.
4. Zlotov, A.V. and Khachaturov, V.P., Application of the Approximate Combinatorial Method for Designing Optimal Networks with Nonlinear Edge Cost Functions, in Soobshcheniya po prikladnoi matematike (Reports on Applied Mathematics), Moscow: Vychisl. Tsentr Akad. Nauk SSSR, 1984.
5. Erzin, A.I. and Mordvinova, T.B., An Optimal Tree Design, Upravl. Sist., 1983, no. 23, pp. 44-54.
6. Primenenie matematicheskikh metodov i EVM pri proektirovanii avtomobil'nykh dorog na neodnorodnoi Lerritorii (Application of Mathematical Methods and Computers for Designing Highways on a Heterogeneous Territory), Tsygankov, V.A., Ed., Chelyabinsk: Pedagogical Inst., 1984.
7. Gordeev, E.N. and Tarastsov, O.G., The Steiner Problem: A Review, Diskretn. Mat., 1993, vol. 5, no. 2, pp. 3-28.
8. Gilbert, E.N. and Pollack, H.O., Steiner Minimal Trees, SIAM J. Appl. Math., no. 16, pp. 1-17.
9. Hakimi, S.L., Steiner's Problem in Graphs and Its Applications, Networks, 1971, vol. 1, pp. 113-133.
10. Garey, M.R. and Johnson, D.S., Computers and Intractability: A Guide to the Theory of NP-Completeness, San Francisco: Freeman, 1979. Translation under the title Vychislitel'nye mashiny i trudnoreshaemye zadachi, Moscow: Mir, 1982.
11. Garey, M.R. and Johnson, D.S., Computers and Intractability: A Guide to the Theory of NP-Completeness, San Francisco: Freeman, 1979. Translation under the title Vychislitel'nye mashiny i trudnoreshaemye zadachi, Moscow: Mir, 1982.
12. Winter, P., Steiner Problem in Halin Networks, Discrete Appl. Math., 1987, vol. 17, no. 3, pp. 281-294.
13. Zlotov, A.V., A Combinatorial Algorithm for Designing Networks with Discontinuous Edge Cost Function, Ekon. Mat. Metody. 1978, vol. 14, no. 7, pp. 783-787.
14. Trubin, V.A. and Gndoyan, A.K., Algoritm i svoistva zadachi sinteza setei s odnim istochnikom: teoriya optimal'nykh reshenii (Algorithms and Properties of Design of Networks with One Source: Theory of Optimal Solutions), Kiev: Naukova Dumka, 1980.
15. Lotarev, D.T., The Steiner Problem for a Transport Network on a Surface Defined by a Digital Model, Avtom. Telemekh., 1980, no. 10, pp. 104-115.
16. Pankov, A.V., Pelzwerger, B.V., and Shafir, A.Yu., Optimal Location of Branching Points of a Transport Network on a Digital Locality Model, Avtom. Telemekh., 1990, no. 9, pp. 153-162.
17. Erzin, A.I., An Asymptotic Approach to Solve the Steiner Problem with Concave Flow Cost Function, Preprint of Inst. of Math., Novosibirsk, 1983, no. 4.
18. Pankov, A.V. and Pelzwerger, B.V., Optimal Location of a Tree in a Finite Set, Zh. Vychisl. Mat. Mat. Fiz., 1988, vol. 28, pp. 618-620.
19. Panyukov, A.V. and Pelzwerger, B.V., Polynomial Algorithms to Finite Weber Problem for a Tree Network, J. Comput. Appl. Math., 1991, vol. 35, pp. 291-296.
20. Roshin, G.V., An Algorithm for Constructing the Shortest Connecting Network on a Graph, in Vychisl. tekhnika: sb. st. (Computational Technique: Collected Papers), Kaunas, 1974.
21. Panyukov, A.V., Pelzwerger, B.V., and Shafir, A.Yu., Algoritmy resheniya zadachi Shteinera s potokami na grafe (Algorithms for Solving the Steiner Problem with Flows on a Graph), Available from VINITI, 1983, Chelyabinsk, no. 1664-84.
22. Panyukov, A.V. and Pelzwerger, B.V., An Interactive Procedure for Designing Transport Networks on a Digital Locality Model: Methods of Design and Development Planning for Large-Scale Structures, V Vsesoyuz. seminar, Moscow, 1990.
23. Panyukov, A.V., Pelzwerger, B.V., and Shafir, A.Yu., Dialog-oriented Design Procedure for a Transport Network: Methods of Mathematical Programming and Software, Abst. Conf., Sverdlovsk, 1991.
24. Panyukov, A.V., Pelzwerger, B.V., and Shafir, A.Yu., Local Topology Searching Algorithms for the Steiner Problem on Graphs: Methods of Mathematical Programming and Software, Abst. Conf., Sverdlovsk, 1991.
25. Red'ko, V.G., Evolyutsionnaya kibernetika (Evolutionary Cybernetics), Moscow: Nauka, 2001.
26. Nefedov, V.N. and Osipova, V.A., Kurs diskretnoi matematiki (A Course in Discrete Mathematics), Moscow: Mosk. Aviat. Inst., 1992.
27. Poluektova, E.B., A Method of Application of Genetic Algorithms to the Steiner Problem on a Graph, in Inform, byul. assotsiatsii mat. programmirovaniya (Information Bulletin of Mathematical Programming), Yekaterinburg: Ross. Akad. Nauk, 2003, no. 10.
28. Panyukov, A.V., Optimization of Location of Controls for Complex Developing Systems: Methods of Design and Development Planning for Large-Scale Structures, III Vsesoyuz. Seminar, Moscow, 1985.
29. Korbut, A.A., Sigal, I.H., and Finkelstein, Yu.Yu., The Branch-and-Bound Method (Review of Theory, Algorithms, Programs, and Applications), Math. Oper. Statist., Ser. Optimiz., 1980, vol. 8, no. 2, pp. 253-280.
30. Korbut, A.A. and Finkelstein, Yu.Yu., Diskretnoe programmirovanie (Discrete Programming), Moscow: Nauka, 1969.
31. Panyukov, A.V., Pelzwerger, B.V., and Shafir, A.Yu., Enhancing the Effectiveness of Algorithms for the Steiner Problem on Graphs with Admissibility of Topologies: Methods and Programs for Optimization on Graphs and Networks. Part. 2: Theory and Algorithms, Abst. III Vses. Sovesh., Novosibirsk, 1984.
32. Panyukov, A.V., Pelzwerger, B.V., and Shafir, A.Yu., Sequential Analysis of Topologies in the Steiner Problem on Graphs, III Vsesoyuz. shk. "Diskretnaya optimizatsiya i komp'yutery: teoriya, metody, programmnoe obespechenie i prilozheniya v ekonomike, informatike, tekhnike" (Abst. III All-Union School "Discrete Optimization and Computers: Theory, Methods, Software, and Applications in Economics, Informatics, and Engineering), Moscow, 1987.
33. Panyukov, A.V., Pelzwerger, B.V., and Shafir, A.Yu., A System of Competing Algorithms for the Steiner Problem with Flows on Graphs: Optimal Planning Software, X Vsesoyuz. simpozium (X All-Union Seminar), Moscow, 1987.