On the tree inclusion problem
✍ Scribed by Laurent Alonso; René Schott
- Publisher
- Springer-Verlag
- Year
- 2001
- Tongue
- English
- Weight
- 130 KB
- Volume
- 37
- Category
- Article
- ISSN
- 0001-5903
No coin nor oath required. For personal study only.
📜 SIMILAR VOLUMES
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
This paper considers a generalized version of the stochastic spanning tree problem in which edge costs are random variables and the objective is to find a spectrum of optimal spanning trees satisfying a certain chance constraint whose right-hand side also is treated as a decision variable. A special