| Issue |
RAIRO-Oper. Res.
Volume 37, Number 3, July-September 2003
|
|
|---|---|---|
| Page(s) | 179 - 194 | |
| DOI | https://doi.org/10.1051/ro:2003020 | |
| Published online | 15 December 2003 | |
Constrained Steiner trees in Halin graphs
1
The School of Science,
Hangzhou Institute of Electronics Engineering, Hangzhou 310037,
P.R. China; gtchen@sci.hziee.edu.cn.
2
Technische Universität Graz, Institut für
Mathematik, Steyrergasse 30, A-8010 Graz, Austria; burkard@tugraz.at.
Received:
28
February
2003
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.
Key words: Steiner trees / Halin graph / approximation scheme.
© EDP Sciences, 2003
Current usage metrics show cumulative count of Article Views (full-text article views including HTML views, PDF and ePub downloads, according to the available data) and Abstracts Views on Vision4Press platform.
Data correspond to usage on the plateform after 2015. The current usage metrics is available 48-96 hours after online publication and is updated daily on week days.
Initial download of the metrics may take a while.