Optimal Interconnection Trees in the Plane / Algorithms and Combinatorics Bd.29 (PDF)
- Kreditkarte, Paypal, Rechnung
- Kostenloser tolino webreader
This book explores fundamental aspects of geometric network optimisation with applications to a variety of real world problems. It presents, for the first time in the literature, a cohesive mathematical framework within which the properties of such optimal interconnection networks can be understood across a wide range of metrics and cost functions. The book makes use of this mathematical theory to develop efficient algorithms for constructing such networks, with an emphasis on exact solutions.
Marcus Brazil and Martin Zachariasen focus principally on the geometric structure of optimal interconnection networks, also known as Steiner trees, in the plane. They show readers how an understanding of this structure can lead to practical exact algorithms for constructing such trees.
The book also details numerous breakthroughs in this area over the past 20 years, features clearly written proofs, and is supported by 135 colour and 15 black and white figures. It will help graduate students, working mathematicians, engineers and computer scientists to understand the principles required for designing interconnection networks in the plane that are as cost efficient as possible.
Martin Zachariasen is Head of Department and Professor at the Department of Computer Science, University of Copenhagen. He has worked on heuristics and exact methods for classical NP-hard problems, such as the geometric Steiner Tree Problem, as well as other optimization problems. His general research interests are in experimental algorithmics and computational combinatorial optimization, in particular related to VLSI design. As well as writing more than 40 papers on these topics, he is one of the developers of GeoSteiner, which is by far the most efficient software for solving a range of geometric Steiner tree problems.
- Autoren: Marcus Brazil , Martin Zachariasen
- 2015, 2015, 344 Seiten, Englisch
- Verlag: Springer-Verlag GmbH
- ISBN-10: 3319139150
- ISBN-13: 9783319139159
- Erscheinungsdatum: 13.04.2015
Abhängig von Bildschirmgrösse und eingestellter Schriftgrösse kann die Seitenzahl auf Ihrem Lesegerät variieren.
- Dateiformat: PDF
- Grösse: 6.79 MB
- Ohne Kopierschutz
- Vorlesefunktion
“The focus of this monograph is the geometricSteiner tree problem, i.e., how to optimally connect, in a geometric plane, acollection of n given terminals, together with an additional set of Steinerpoints, in terms of a measuring metric. … monograph is also intended as atextbook at a graduate level, thus comes with a decent collection of exercises,with varying difficulty degrees, at the end of each chapter, mostly assigned ina relevant context throughout the main text.” (Zhizhang Shen, zbMATH 1319.05044,2015)
| Zustand | Preis | Porto | Zahlung | Verkäufer | Rating |
|---|
Schreiben Sie einen Kommentar zu "Optimal Interconnection Trees in the Plane / Algorithms and Combinatorics Bd.29".
Kommentar verfassen