株式会社極東書店トップ ＞ 商品一覧 ＞ Advances in Steiner Trees. Softcover reprint of hardcover 1st ed. 2000.
商品詳細
Advances in Steiner Trees. Softcover reprint of hardcover 1st ed. 2000.
・ISBN 978-1-4419-4824-3 paper EUR 99.99
￥26,726.- (税込) ※（※）価格はご注文時の参考価格となります。
納品価格につきましては書籍の入荷時点で確定となります。
版元の原価改定、外国為替の変動等により異なる場合がございますので、予めご了承下さい。
お気に入り
★★★
| 著者・編者 | Du, Ding-Zhu / Smith, J.M. / Rubinstein, J. Hyam (eds.), |
|---|---|
| シリーズ | Combinatorial Optimization |
| 出版社 | (Springer-Verlag New York Inc., US) |
| 出版年月 | 2010 |
| ページ数 | 323 pp. |
| 言語 | ENG |
| ニュース番号 | ＜M25-17401＞ |
解説
The Volume on Advances in Steiner Trees is divided into two sections. The first section of the book includes papers on the general geometric Steiner tree problem in the plane and higher dimensions. The second section of the book includes papers on the Steiner problem on graphs. The general geometric Steiner tree problem assumes that you have a given set of points in some d-dimensional space and you wish to connect the given points with the shortest network possible. The given set ofpoints are 3 Figure 1: Euclidean Steiner Problem in E usually referred to as terminals and the set ofpoints that may be added to reduce the overall length of the network are referred to as Steiner points. What makes the problem difficult is that we do not know a priori the location and cardinality ofthe number ofSteiner points. Thus)the problem on the Euclidean metric is not known to be in NP and has not been shown to be NP-Complete. It is thus a very difficult NP-Hard problem.