𝔖 Scriptorium
✦   LIBER   ✦
πŸ“

The Steiner Tree Problem

✍ Scribed by Frank K. Hwang, Dana S. Richards and Pawel Winter (Eds.)

Publisher
North-Holland
Year
1992
Tongue
English
Leaves
353
Series
Annals of Discrete Mathematics 53
Category
Library
⬇  Acquire This Volume

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

The Steiner Tree Problem
πŸ“ The Steiner Tree Problem
✍ Frank K. Hwang, Dana S. Richards, Pawel Winter πŸ“‚ Library πŸ“… 1992 πŸ› North-Holland 🌐 English

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

The Steiner Tree Problem
πŸ“ The Steiner Tree Problem
✍ Frank K. Hwang, Dana S. Richards and Pawel Winter (Eds.) πŸ“‚ Library πŸ“… 1992 πŸ› Elsevier, Academic Press 🌐 English

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

The Steiner Tree Problem
πŸ“ The Steiner Tree Problem
✍ Frank K. Hwang, Dana S. Richards and Pawel Winter (Eds.) πŸ“‚ Library πŸ“… 1992 πŸ› Elsevier, Academic Press 🌐 English

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

The Steiner tree problem
πŸ“ The Steiner tree problem
✍ Frank K. Hwang, Dana S. Richards, Pawel Winter πŸ“‚ Library πŸ“… 1992 πŸ› North-Holland 🌐 English

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

The Steiner Tree Problem: A Tour through
πŸ“ The Steiner Tree Problem: A Tour through Graphs, Algorithms, and Complexity
✍ Prof. Dr. Hans JΓΌrgen PrΓΆmel, Prof. Dr. Angelika Steger (auth.) πŸ“‚ Library πŸ“… 2002 πŸ› Vieweg+Teubner Verlag 🌐 English

<p>In recent years, algorithmic graph theory has become increasingly important as a link between discrete mathematics and theoretical computer science. This textbook introduces students of mathematics and computer science to the interrelated fields of graphs theory, algorithms and complexity. No spe