F. Bauer and A. Varma, Degree-constrained multicasting in point-to-point networks, Proceedings of INFOCOM'95, p.369, 1995.
DOI : 10.1109/INFCOM.1995.515897

N. Deo and S. Hakimi, The shortest generalized Hamiltonian tree, 6th Annual Allerton Conference, pp.879-888, 1968.

M. R. Garey and D. S. Johnson, Computers and Intractability: A Guide to the Theory of NP-Completeness, 1979.

P. Hell and J. Nesetril, Graphs and Homomorphisms, 2004.
DOI : 10.1093/acprof:oso/9780198528173.001.0001

M. Massinissa, S. Durand, and M. Molnar, Exact solution for branch vertices constrained spanning problems, Electronic Notes in Discrete Mathematics, vol.41, pp.527-534, 2013.
DOI : 10.1016/j.endm.2013.05.134

M. Merabet, S. Durand, and M. Molnar, Exact solution for bounded degree connected spanning problems
URL : https://hal.archives-ouvertes.fr/lirmm-00745713

M. Molnar, Hierarchies to Solve Constrained Connected Spanning Problems, Tech. rep., LIRMM, 2011.
URL : https://hal.archives-ouvertes.fr/lirmm-00619806

M. Molnar, S. Durand, and M. Merabet, Approximation of the Degree-Constrained Minimum Spanning Hierarchies, Tech. rep., LIRMM, 2013.
DOI : 10.1007/978-3-319-09620-9_9
URL : https://hal.archives-ouvertes.fr/lirmm-00907052

R. Ravi, M. V. Marathe, S. S. Ravi, D. J. Rosenkrantz, and H. B. Iii, Approximation Algorithms for Degree-Constrained Minimum-Cost Network-Design Problems, Algorithmica, vol.31, issue.1, pp.58-78, 2001.
DOI : 10.1007/s00453-001-0038-2

A. Sebö, Eight-Fifth Approximation for the Path TSP, pp.362-374, 2013.

S. Voss, Problems with generalized steiner problems, Algorithmica, vol.16, issue.1-6, pp.333-335, 1992.
DOI : 10.1007/BF01758767

F. Zhou, M. Molnar, and B. Cousin, Light-Hierarchy: The Optimal Structure for Multicast Routing in WDM Mesh Networks, 15th IEEE Symposium on Computers and Communications (ISCC), pp.611-6165643912, 2010.
URL : https://hal.archives-ouvertes.fr/hal-00541047