Steiner Tree Problem and Networks
Steiner Tree Problem:
If N is a set of points in the plane, the Euclidean Steiner Tree Problem is: Find a set of line segments so that all the points are connected with each other and so that the total Euclidean length of the line segments is minimized. Steiner Trees are applied to a number of different real world problems. Most notably is the application in networks and computer chips. There are methods to solving the Steiner Tree Problem using geometry. Take a look at the worksheet and presentation below to learn more information. |
Steiner problem worksheet | |
File Size: | 282 kb |
File Type: |
Steiner Problem and Networks Powerpoint | |
File Size: | 722 kb |
File Type: |