Steiner tree problem
- 20 Downloads
For a network with N nodes, we are given a subset S of its nodes. The problem is to determine a minimum length (cost) tree that contains all the nodes of S and, optionally, some other nodes from the set N. The Steiner tree problem is often defined on the Euclidean plane where the problem is to find the minimum length (distance) tree that spans a given set of S nodes. Here, the tree can contain nodes (points) other than those in S. Minimum spanning tree.