.png){kind=logo}
Stock image for illustration purposes only - book cover, edition or condition may vary.
Steiner Ratio
Dietmar Cieslik
€ 129.01
FREE Delivery in Ireland
Description for Steiner Ratio
Paperback. Series: Combinatorial Optimization. Num Pages: 256 pages, biography. BIC Classification: PBKS; PBMW; PBU; UYA. Category: (P) Professional & Vocational. Dimension: 279 x 210 x 14. Weight in Grams: 648.
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. However, if only a Minimum Spanning Tree (MST) without additional vertices in the interconnecting network is sought, then it is ... Read more
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. However, if only a Minimum Spanning Tree (MST) without additional vertices in the interconnecting network is sought, then it is ... Read more
Product Details
Format
Paperback
Publication date
2010
Publisher
Springer-Verlag New York Inc. United States
Number of pages
256
Condition
New
Series
Combinatorial Optimization
Number of Pages
244
Place of Publication
New York, NY, United States
ISBN
9781441948564
SKU
V9781441948564
Shipping Time
Usually ships in 15 to 20 working days
Ref
99-15
Reviews for Steiner Ratio