The Steiner tree problem [electronic resource] / Frank K. Hwang, Dana S. Richards, Pawel Winter.

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

Online Access:	Full Text (via ScienceDirect)
Main Author:	Hwang, Frank
Other Authors:	Richards, Dana, 1955-, Winter, Pawel, 1952-
Format:	Electronic eBook
Language:	English
Published:	Amsterdam ; New York : North-Holland, 1992.
Series:	Annals of discrete mathematics ; 53.
Subjects:	Steiner systems.