The Steiner Problem in Graphs: Topological Methods of Solution

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.