P. Winter, Steiner problem in networks: A survey, Networks, vol.19, issue.2, pp.129-167, 1987.
DOI : 10.1002/net.3230170203

S. Ramanathan, Multicast Tree Generation in Networks With Asymmetric Links, IEEE/ACM Transactions on Networking, vol.4, issue.4, 1996.

H. Takahashi and A. Matsuyama, An approximate solution for the Steiner problem in graphs, Math. Japonica, vol.24, 1981.

F. Bauer and A. Varma, Distributed Algorithms for Multicast Path Setup in Data Networks, IEEE/ACM Transactions on Networking, vol.4, issue.2, 1996.

L. Kou, G. Markowsky, and L. Berman, A fast algorithm for Steiner trees, Acta Informatica, vol.30, issue.2, pp.141-145, 1981.
DOI : 10.1007/BF00288961

V. P. Kompella, J. C. Pasquale, and G. C. Polyzos, Multicast routing for multimedia communication, IEEE/ACM Transactions on Networking, vol.1, issue.3, 1993.
DOI : 10.1109/90.234851
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.12.8162

F. K. Hwang and D. S. Richards, Steiner tree problems, Networks, vol.20, issue.1, pp.55-89, 1992.
DOI : 10.1002/net.3230220105

I. Charon, A. Germa, and O. Hudry, Méthode d'optimisation combinatoire, pp.50-51, 1996.

A. Z. Zelikovsky, An 11/6-approximation algorithm for the network steiner problem, Algorithmica, vol.17, issue.5, pp.463-470, 1993.
DOI : 10.1007/BF01187035

I. Unité-de-recherche, . Lorraine, V. Technopôle-de-nancy-brabois, I. Unité-de-recherche, . Rennes et al., 35042 RENNES Cedex Unité de recherche INRIA Rhône-Alpes, 2004.