|
Avtomatika i Telemekhanika, 2004, Issue 3, Pages 89–99
(Mi at1544)
|
|
|
|
This article is cited in 7 scientific papers (total in 7 papers)
Discrete Optimization
The steiner problem in graphs: topological methods of solution
A. V. Panyukov South Ural State University, Chelyabinsk
Abstract:
Algorithms for the Steiner problem and its generalizations on large graphs with a relatively small number of terminal vertices are designed by a two-level solution scheme: a network topology (i.e., a tree determining the adjacency of terminal vertices and branching points) is determined in the upper level and the optimal location for branching points with the topology found in the upper level is determined in the lower level.
Citation:
A. V. Panyukov, “The steiner problem in graphs: topological methods of solution”, Avtomat. i Telemekh., 2004, no. 3, 89–99; Autom. Remote Control, 65:3 (2004), 439–448
Linking options:
https://www.mathnet.ru/eng/at1544 https://www.mathnet.ru/eng/at/y2004/i3/p89
|
|