๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

On the Complexity of the Steiner Problem

โœ Scribed by M. Brazil; D.A. Thomas; J.F. Weng


Book ID
110281928
Publisher
Springer US
Year
2000
Tongue
English
Weight
63 KB
Volume
4
Category
Article
ISSN
1382-6905

No coin nor oath required. For personal study only.


๐Ÿ“œ SIMILAR VOLUMES


The Steiner problem on a surface
โœ Jiang Xin-yao ๐Ÿ“‚ Article ๐Ÿ“… 1987 ๐Ÿ› Springer ๐ŸŒ English โš– 273 KB
Some remarks on the Steiner problem
โœ H.O Pollak ๐Ÿ“‚ Article ๐Ÿ“… 1978 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 779 KB
On the terminal Steiner tree problem
โœ Guohui Lin; Guoliang Xue ๐Ÿ“‚ Article ๐Ÿ“… 2002 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 69 KB

We investigate a practical variant of the well-known graph Steiner tree problem. In this variant, every target vertex is required to be a leaf vertex in the solution Steiner tree. We present hardness results for this variant as well as a polynomial time approximation algorithm with performance ratio

The Steiner Problem on Surfaces of Revol
โœ Elena A. Caffarelli, Denise M. Halverson, Ryan J. Jensen ๐Ÿ“‚ Article ๐Ÿ“… 2012 ๐Ÿ› Springer Japan ๐ŸŒ English โš– 540 KB