Not checkedNot checked for notices yet.
Allocation of steinerpoints in euclidean Steiner tree problem by means of MatLab package
D. T. Lotarev
Компьютерные исследования и моделирование · 2015
doi:10.20537/2076-7633-2015-7-3-707-713 (opens in a new tab)
We email you when a new notice or a question about this paper appears.
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
Abstract licence: CC BY-ND
Reads
Read by people on this page
None yet.
Checked or read by AI through naulon
None yet.
A person counts once a day per paper. We keep no cookie and no address: a reader is a hash that changes every day. Any month under five reads shows no number.
Are you an author?
Is this your paper?
Claim it to add your note and be paid when agents cite it. Free.