Verwandte Artikel zu Advances in Steiner Trees: 6 (Combinatorial Optimization)
Zu dieser ISBN ist aktuell kein Angebot verfügbar.
Alle Exemplare der Ausgabe mit dieser ISBN anzeigen:
Book by None
Die Inhaltsangabe kann sich auf eine andere Ausgabe dieses Titels beziehen.
Reseña del editor:
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.
Reseña del editor:
This book presents an up-to-date set of contributions by the most influential authors on the Steiner Tree problem. The authors address the latest concerns of Steiner Trees for their computational complexity, design of algorithms, performance guaranteed heuristics, computational experimentation, and range of applications.
Audience: The book is intended for advanced undergraduates, graduates and research scientists in Combinational Optimization and Computer Science. It is divided into two sections: Part I includes papers on the general geometric Steiner Tree problem in the plane and higher dimensions; Part II includes papers on the Steiner problem on graphs which has significant import to Steiner Tree applications.
Audience: The book is intended for advanced undergraduates, graduates and research scientists in Combinational Optimization and Computer Science. It is divided into two sections: Part I includes papers on the general geometric Steiner Tree problem in the plane and higher dimensions; Part II includes papers on the Steiner problem on graphs which has significant import to Steiner Tree applications.
„Über diesen Titel“ kann sich auf eine andere Ausgabe dieses Titels beziehen.
- VerlagSpringer
- Erscheinungsdatum2000
- ISBN 10 0792361105
- ISBN 13 9780792361107
- EinbandTapa dura
- Anzahl der Seiten340
- HerausgeberDu Ding-Zhu, Smith J.M., Rubinstein J. Hyam
Neu kaufen
Mehr zu diesem Angebot erfahren
EUR 111,07
Versand:
EUR 32,99
Von Deutschland nach USA
Beste Suchergebnisse beim ZVAB
Foto des Verkäufers
Advances in Steiner Trees
Anbieter:
Bewertung
Buchbeschreibung 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 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. Artikel-Nr. 9780792361107
Weitere Informationen zu diesem Verkäufer | Verkäufer kontaktieren
Neu kaufen
EUR 111,07
Währung umrechnen