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

Voir la notice de l'article provenant de la source Numdam

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 : 10.1051/ro:2003020
Keywords: 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},
     mrnumber = {2034538},
     zbl = {1039.05058},
     language = {en},
     url = {http://geodesic.mathdoc.fr/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
SP  - 179
EP  - 194
VL  - 37
IS  - 3
PB  - EDP-Sciences
UR  - http://geodesic.mathdoc.fr/articles/10.1051/ro:2003020/
DO  - 10.1051/ro:2003020
LA  - en
ID  - RO_2003__37_3_179_0
ER  - 
%0 Journal Article
%A Chen, Guangting
%A Burkard, Rainer E.
%T Constrained Steiner trees in Halin graphs
%J RAIRO - Operations Research - Recherche Opérationnelle
%D 2003
%P 179-194
%V 37
%N 3
%I EDP-Sciences
%U http://geodesic.mathdoc.fr/articles/10.1051/ro:2003020/
%R 10.1051/ro:2003020
%G en
%F RO_2003__37_3_179_0
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

Cité par Sources :