Loading…
The Steiner tree problem /
The Steiner problem asks for a shortest network which spans a given set of points. Minimum spanning networks have been well-studied when all connections are required to be between the given points. The novelty of the Steiner tree problem is that new auxiliary points can be introduced between the ori...
| Call Number: | Libro Electrónico |
|---|---|
| Main Author: | |
| Other Authors: | , |
| Format: | Electronic eBook |
| Language: | Inglés |
| Published: |
Amsterdam ; New York :
North-Holland,
1992.
|
| Series: | Annals of discrete mathematics ;
53. |
| Subjects: | |
| Online Access: | Texto completo Texto completo Texto completo |
Table of Contents:
- Front Cover; The Steiner Tree Problem; Copyright Page; Foreword; Contents; Part I: Euclidean Steiner Problem; Chapter 1. Introduction; Chapter 2. Exact Algorithms; Chapter 3. The Steiner Ratio; Chapter 4. Heuristics; Chapter 5. Special Terminal-Sets; Chapter 6. Generalizations; Part II: Steiner Problem in Networks; Chapter 1. Introduction; Chapter 2. Reductions; Chapter 3. Exact Algorithms; Chapter 4. Heuristics; Chapter 5. Polynomially Solvable Cases; Chapter 6. Generalizations; Part III: Rectilinear Steiner Problem; Chapter 1. Introduction; Chapter 2. Heuristic Algoritlinis.