P. Fraigniaud and E. Lazard, Methods and problems of communication in usual networks, Discrete Applied Mathematics, vol.53, issue.1-3, pp.79-133, 1994.
DOI : 10.1016/0166-218X(94)90180-5

M. Garey and D. Johnson, Computers and Intractability: a guide to theory of NP-Completeness, 1979.

S. M. Hedetniemi, S. T. Hedetniemi, and A. L. Liestman, A survey of gossiping and broadcasting in communication networks, Networks, vol.3, issue.4, pp.319-349, 1986.
DOI : 10.1002/net.3230180406

A. Quayyum, L. Viennot, and A. Laouiti, Multipoint relaying: an efficient technique for flooding in mobile wireless networks, 2000.

S. Vob, Steiner's problem in graphs: heuristic methods, Discrete Applied Mathematics, vol.401, issue.01, pp.45-72, 1992.

D. Wagner and F. Wagner, Steiner's problem in graphs: heuristic methods, Discrete Applied Mathematics, vol.401, issue.01, pp.73-82, 1992.

P. Winter, Steiner problem in networks: a survey. Networks INRIA Unité de recherche INRIA Rhône-Alpes 655, avenue de l'Europe -38334 Montbonnot Saint-Ismier (France) Unité de recherche INRIA Futurs : Parc Club Orsay Université -ZAC des Vignes 4, pp.129-167, 1987.

I. Unité-de-recherche and . Lorraine, Technopôle de Nancy-Brabois -Campus scientifique 615, rue du Jardin Botanique -BP 101 -54602 Villers-lès-Nancy Cedex (France) Unité de recherche INRIA Rennes : IRISA, Campus universitaire de Beaulieu -35042 Rennes Cedex (France) Unité de recherche INRIA Rocquencourt : Domaine de Voluceau -Rocquencourt -BP 105 -78153 Le Chesnay Cedex (France) Unité de recherche, 2004.

I. De-voluceau-rocquencourt, BP 105 -78153 Le Chesnay Cedex (France) http://www.inria.fr ISSN, pp.249-6399