H. Lin, Z. Yu-lin, and R. Yong-hong, Two multi-constrained multicast QoS routing algorithms, Eighth ACIS International Conference on Software Engineering, Artificial Intelligence, Networking, and Parallel/Distributed Computing (SNPD 2007), 2007.
DOI : 10.1109/SNPD.2007.457

V. Aggarwal, Y. P. Aneja, and K. P. Nair, Minimal spanning tree subject to a side constraint, Computers & Operations Research, vol.9, issue.4, pp.287-296, 1982.
DOI : 10.1016/0305-0548(82)90026-0

F. Bauer and A. Varma, ARIES: A Rearrangeable Inexpensive Edge-Based On-Line Steiner Algorithm, INFOCOM, pp.361-368, 1996.

Z. Wang and J. Crowcroft, Quality-of-service routing for supporting multimedia applications, IEEE Journal on Selected Areas in Communications, vol.14, issue.7, pp.1228-1234, 1996.
DOI : 10.1109/49.536364

J. Crichigno and B. Baran, A Multicast Routing Algorithm using Multiobjective Optimization, ICT, pp.1107-1113, 2004.

G. Feng, A multi-constrained multicast QoS routing algorithm, Computer Communications, vol.29, issue.10, pp.1811-1822, 2006.
DOI : 10.1016/j.comcom.2005.10.014

S. L. Hakimi, Steiner's problem in graphs and its implications, Networks, vol.22, issue.2, pp.113-133, 1971.
DOI : 10.1002/net.3230010203

S. P. Hong, S. J. Chung, and B. H. Park, A fully polynomial bicriteria approximation scheme for the constrained spanning tree problem, Operations Research Letters, vol.32, issue.3, pp.233-239, 2004.
DOI : 10.1016/j.orl.2003.06.003

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

P. V. Kompella, J. C. Pasquale, and G. C. Polyzos, Multicast routing for multimedia communication, IEEE/ACM Transactions on Networking, vol.1, issue.3, pp.286-292, 1993.
DOI : 10.1109/90.234851

T. Korkmaz and M. Krunz, Multi-constrained optimal path selection, INFOCOM, pp.834-843, 2001.

F. A. Kuipers and P. Van-mieghem, MAMCRA: a constrained-based multicast routing algorithm, Computer Communications, vol.25, issue.8, pp.802-811, 2002.
DOI : 10.1016/S0140-3664(01)00402-9

M. S. Levin and R. I. Nuiriakhmetov, Multicriteria Steiner Tree Problem for Communication Network, Information Technology in Engineering Systems, vol.9, issue.3, pp.199-209, 2009.

P. Van-mieghem and F. A. Kuipers, Concepts of Exact QoS Routing Algorithms, IEEE/ACM Transactions on Networking, vol.12, issue.5, pp.851-864, 2004.
DOI : 10.1109/TNET.2004.836112

M. Molnár, Optimisation des communications multicast sous contraintes, University Rennes 1, 2008.

D. Pinto, B. Barán, and R. Fabregat, Multi-Objective Multicast Routing Based on Ant Colony Optimization, Proceeding of the 2005 Conference on Artificial Intelligence Research and Development, pp.363-370, 2005.

H. Takahashi and A. Matsuyama, An approximate solution for the Steiner problem in graphs, Journal of Mathematica Japonica, vol.24, issue.6, pp.573-577, 1980.

P. Van-mieghem, H. De-neve, and A. F. Kuipers, Hop-by-hop quality of service routing, Computer Networks, vol.37, issue.3-4, pp.407-423, 2001.
DOI : 10.1016/S1389-1286(01)00222-5

D. Wang, F. Ergun, and Z. Xu, Unicast and Multicast QoS Routing with Multiple Constraints, Quality of Service in Multiservice IP Networks, pp.481-494, 2005.

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

X. Zhang, J. Wei, and C. Qiao, Constrained multicast routing in WDM networks with sparse light splitting, INFOCOM, pp.1781-1790, 2000.

Z. Qing, P. Mehrdad, and J. J. Garcia-luna-aceves, A Source-Based Algorithm for Delay-Constrained Minimum-Cost Multicasting, INFOCOM, pp.377-385, 1995.