The Steiner Ratio

by D. Cieslik

Steiner's Problem concerns finding a shortest interconnecting network for a finite set of points in a metric space. A solution must be a tree, which is called a Steiner Minimal Tree (SMT), and may contain vertices different from the points which are to be connected. Steiner's Problem is one of the most famous combinatorial-geometrical problems, but unfortunately it is very difficult in terms of combinatorial structure as well as computational complexity...

• Format: Hardcover
• Language: English
• ISBN: 0792370155
• ISBN13: 9780792370154
• Release Date: August 2001
• Publisher: Springer
• Length: 244 Pages
• Weight: 1.19 lbs.
• Dimensions: 0.6" x 6.1" x 9.2"