Article contents
Constrained Steiner trees in Halin graphs
Published online by Cambridge University Press: 15 December 2003
Abstract
In this paper, we study the problem of computing a minimum cost Steiner tree subject to a weight constraint in a Halin graph where each edge has a nonnegative integer cost and a nonnegative integer weight. We prove the NP-hardness of this problem and present a fully polynomial time approximation scheme for this NP-hard problem.
- Type
- Research Article
- Information
- Copyright
- © EDP Sciences, 2003
References
- 4
- Cited by