The Optimal Tree-like Networks Constructing Algorithms

The report deals with the exact and approximate optimal network construction algorithms with discontinuous cost functions depending on the Flow at their edges. The properties of the optimal solution of this problem are established, an algorithm for forming all trees and single-root subtrees for the graph under consideration is described.