A. A. Kharkevich Institute for Information Transmission Problems, Russian Academy of Sciences, 19/1 Bolshoy Karetny per., Moscow 127051, Russia
Abstract:
The problem of allocation of Steiner points in Euclidean Steiner Tree is considered. The cost of network is sum of building costs and cost of the information transportation. Euclidean Steiner tree problem in the form of topological network design is a good model of this problem.
The package MatLab has the way to solve the second part of this problem — allocate Steiner points under condition that the adjacency matrix is set. The method to get solution has been worked out. The Steiner tree is formed by means of solving of the sequence of "three points" Steiner
Keywords:Steiner problem, Steiner point, source resource, consumer resource, “three points” Steiner problem, task for bigger number, decrease dimension.
Fulltext:
PDF file (999 kB)