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: | Hwang, Frank |
Other Authors: | Richards, Dana, 1955-, Winter, Pawel, 1952- |
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 |
Similar Items
-
Topics on Steiner systems /
Published: (1980) -
Steiner tree problems in computer communication networks /
by: Du, Dingzhu
Published: (2008) -
Steiner tree problems in computer communication networks /
by: Du, Dingzhu
Published: (2008) -
Branching solutions to one-dimensional variational problems /
by: Ivanov, A. O. (Alexander O.)
Published: (2001) -
Branching solutions to one-dimensional variational problems /
by: Ivanov, A. O. (Alexander O.)
Published: (2001)