Cover Image

The Steiner tree problem /

Show other versions (1)

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...

Full description

Bibliographic Details
Main Author: Hwang, Frank
Corporate Author: ScienceDirect (Online service)
Other Authors: Richards, Dana, 1955-, Winter, Pawel, 1952-
Format: eBook
Language:English
Language Notes:English.
Published: Amsterdam ; New York : North-Holland, 1992.
Series:Annals of discrete mathematics ; 53.
Subjects:
Steiner systems.
Systèmes de Steiner.
MATHEMATICS > Graphic Methods.
Steiner systems
Handelsreizigersprobleem.
Netwerkanalyse.
Steiner, systèmes de.
Graph theory
Electronic books.
Online Access:Connect to the full text of this electronic book
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.