Constrained Steiner trees in Halin graphs
RAIRO - Operations Research - Recherche Opérationnelle, Tome 37 (2003) no. 3, pp. 179-194.

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.

DOI : https://doi.org/10.1051/ro:2003020
Mots clés : Steiner trees, Halin graph, approximation scheme
@article{RO_2003__37_3_179_0,
author = {Chen, Guangting and Burkard, Rainer E.},
title = {Constrained {Steiner} trees in {Halin} graphs},
journal = {RAIRO - Operations Research - Recherche Op\'erationnelle},
pages = {179--194},
publisher = {EDP-Sciences},
volume = {37},
number = {3},
year = {2003},
doi = {10.1051/ro:2003020},
zbl = {1039.05058},
mrnumber = {2034538},
language = {en},
url = {http://www.numdam.org/articles/10.1051/ro:2003020/}
}
TY  - JOUR
AU  - Chen, Guangting
AU  - Burkard, Rainer E.
TI  - Constrained Steiner trees in Halin graphs
JO  - RAIRO - Operations Research - Recherche Opérationnelle
PY  - 2003
DA  - 2003///
SP  - 179
EP  - 194
VL  - 37
IS  - 3
PB  - EDP-Sciences
UR  - http://www.numdam.org/articles/10.1051/ro:2003020/
UR  - https://zbmath.org/?q=an%3A1039.05058
UR  - https://www.ams.org/mathscinet-getitem?mr=2034538
UR  - https://doi.org/10.1051/ro:2003020
DO  - 10.1051/ro:2003020
LA  - en
ID  - RO_2003__37_3_179_0
ER  - 
Chen, Guangting; Burkard, Rainer E. Constrained Steiner trees in Halin graphs. RAIRO - Operations Research - Recherche Opérationnelle, Tome 37 (2003) no. 3, pp. 179-194. doi : 10.1051/ro:2003020. http://www.numdam.org/articles/10.1051/ro:2003020/

[1] G. Chen and G. Xue, A PTAS for weight constrained Steiner trees in series-parallel graphs. Springer-verlag, Lecture Notes in Comput. Sci. 2108 (2001) 519-528. | MR 1935889 | Zbl 0991.68743

[2] G. Chen and G. Xue, K-pair delay constrained minimum cost routing in undirected networks. Proc. of the 13th Annual ACM-SIAM Symposium on Discrete Algorithms (2001) 230-231. | MR 1958413 | Zbl 1018.90006

[3] M.R. Garey and D.S. Johnson, Computers and Intractability: A Guide to the Theory of P-Completeness. San Francisco, W.H. Freeman and Company (1979). | MR 519066 | Zbl 0411.68039

[4] R. Hassin, Approximation schemes for the restricted shortest path problem. Math. Oper. Res. 17 (1992) 36-42. | MR 1148776 | Zbl 0763.90083

[5] F.K. Hwang and D.S. Richards, Steiner tree problems. Networks 22 (1992) 55-89. | MR 1140372 | Zbl 0749.90082

[6] F.K. Hwang, D.S. Richards and P. Winter, The Steiner tree problem. Ann. Discrete Math. 53 (1992) 68-71. | MR 1192785 | Zbl 0774.05001

[7] T. Jiang and L. Wang, Computing shortest networks under a fixed topology, in Advances in Steiner Trees, edited by D.-Z. Du, J.M. Smith and J. H. Rubinstein. Kluwer Academic Publishers (2000) 39-62. | MR 1758347 | Zbl 0947.68117

[8] D.H. Lorenz and D. Raz, A simple efficient approximation scheme for the restricted shortest path problem. Oper. Res. Lett. 28 (2001) 213-219. | MR 1845768 | Zbl 0992.90057

[9] P. Winter, Steiner problem in Halin networks. Discrete Appl. Math. 17 (1987) 281-294. | MR 890638 | Zbl 0623.94024

[10] P. Winter, Steiner problem in networks - a survey. Networks 17 (1987) 129-167. | MR 883025 | Zbl 0646.90028

Cité par Sources :