
Steiner Ratio
Available
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 ter...
Read more
E-book
pdf
Price
89.50 £
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 ter...
Read more
Follow the Author
