.png){kind=logo}
Stock image for illustration purposes only - book cover, edition or condition may vary.
Advances in Steiner Trees
. Ed(S): Du, Ding-Zhu; Smith, J.M. (Dept. Of Industrial Engineering, University Of Massachusetts, Usa); Rubinstein, J. Hyam
€ 134.30
FREE Delivery in Ireland
Description for Advances in Steiner Trees
Hardback. Presents a set of contributions by the most influential authors on the Steiner Tree problem. The authors address the various concerns of Steiner Trees for their computational complexity, design of algorithms, performance guaranteed heuristics, computational experimentation, and range of applications. Editor(s): Du, Ding-Zhu; Smith, J.M. (Dept. of Industrial Engineering, University of Massachusetts, USA); Rubinstein, J. Hyam. Series: Combinatorial Optimization. Num Pages: 335 pages, biography. BIC Classification: PBV. Category: (P) Professional & Vocational; (UP) Postgraduate, Research & Scholarly; (UU) Undergraduate. Dimension: 235 x 155 x 20. Weight in Grams: 653.
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 ... Read more
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 ... Read more
Product Details
Format
Hardback
Publication date
2000
Publisher
Kluwer Academic Publishers United States
Number of pages
335
Condition
New
Series
Combinatorial Optimization
Number of Pages
323
Place of Publication
Dordrecht, Netherlands
ISBN
9780792361107
SKU
V9780792361107
Shipping Time
Usually ships in 15 to 20 working days
Ref
99-15
Reviews for Advances in Steiner Trees