Advances in Steiner Trees
Springer (Verlag)
978-0-7923-6110-7 (ISBN)
The Steiner Ratio of finite-dimensional ?p-spaces.- Shortest Networks for One line and Two Points in Space..- Rectilinear Steiner Minimal Trees on Parallel Lines.- Computing Shortest Networks with Fixed Topologies.- Steiner Trees, Coordinate Systems, and NP-Hardness.- Exact Algorithms for Plane Steiner Tree Problems: A Computational Study.- On Approximation of the Power-p and Bottleneck Steiner Trees.- Exact Steiner Trees in Graphs and Grid Graphs.- Grade of Service Steiner Trees in Series-Parallel Networks.- Preprocessing the Steiner Problem in Graphs.- A Fully-Polynomial Approximation Scheme for the Euclidean Steiner Augmentation Problem.- Effective Local Search Techniques for the Steiner Tree Problem.- Modern Heuristic Search Methods for the Steiner Problem in Graphs.
Erscheint lt. Verlag | 31.1.2000 |
---|---|
Reihe/Serie | Combinatorial Optimization ; 6 |
Zusatzinfo | XII, 323 p. |
Verlagsort | Dordrecht |
Sprache | englisch |
Maße | 155 x 235 mm |
Themenwelt | Mathematik / Informatik ► Mathematik ► Graphentheorie |
Mathematik / Informatik ► Mathematik ► Wahrscheinlichkeit / Kombinatorik | |
ISBN-10 | 0-7923-6110-5 / 0792361105 |
ISBN-13 | 978-0-7923-6110-7 / 9780792361107 |
Zustand | Neuware |
Haben Sie eine Frage zum Produkt? |
aus dem Bereich