9780792361107 - advances in steiner trees (combinatorial optimization, 6, band 6) (3 Ergebnisse)
- Hardcover
Anbieter: Ria Christie Collections, Uxbridge, Vereinigtes KönigreichRia Christie Collections
Verkäufer/-in kontaktierenVerkäufer/-in mit 5 SternenZustand: Neu
EUR 116,25
EUR 13,96 VersandVersand von Vereinigtes Königreich nach USAAnzahl: Mehr als 20 verfügbar
Zustand: New. In.
Advances in Steiner Trees
. Ed(s): Du, Ding-Zhu; Smith, J.M. (Dept. of Industrial Engineering, University of Massachusetts, USA); Rubinstein, J. Hyam
- Hardcover
Anbieter: Kennys Bookstore, Olney, MD, USAKennys Bookstore
Verkäufer/-in kontaktierenVerkäufer/-in mit 5 SternenZustand: Neu
EUR 167,72
EUR 8,99 VersandVersand innerhalb von USAAnzahl: 15 verfügbar
Zustand: New. 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. . 2000. Hardback. . . . . Books ship from the US and Ireland.
- Hardcover
Anbieter: AHA-BUCH GmbH, Einbeck, DeutschlandAHA-BUCH GmbH
Verkäufer/-in kontaktierenVerkäufer/-in mit 5 SternenZustand: Neu
EUR 114,36
EUR 63,38 VersandVersand von Deutschland nach USAAnzahl: 1 verfügbar
Buch. Zustand: Neu. Druck auf Anfrage Neuware - Printed after ordering - 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 Stein…er 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.
