[. Bermond and D. Coudert, The CRC Handbook of Combinatorial Designs, Discrete Mathematics and Its Applications Grooming, vol.4227, pp.493-496, 2006.

J. Bermond, D. Coudert, I. Muñoz, and . Sau, Traffic Grooming in Bidirectional WDM ring networks, IEEE-LEOS ICTON / COST 293 GRAAL, pp.19-22, 2006.
URL : https://hal.archives-ouvertes.fr/inria-00429168

P. [. Chow and . Lin, The ring grooming problem, Networks, vol.8, issue.3, pp.194-202, 2004.
DOI : 10.1002/net.20029

N. [. Dutta and . Rouskas, Traffic grooming in WDM networks: past and future, IEEE Network, vol.16, issue.6, pp.46-56, 2002.
DOI : 10.1109/MNET.2002.1081765

M. Flammini, L. Moscardelli, M. Shalom, and S. Zaks, Approximating the traffic grooming problem, the 16th International Symposium on Algorithms and Computation (ISAAC), 2005.

D. [. Feige, G. Peleg, and . Kortsarz, The Dense k -Subgraph Problem, Algorithmica, vol.29, issue.3, pp.410-421, 2001.
DOI : 10.1007/s004530010050

I. Holyer, The NP-Completeness of Some Edge-Partition Problems, SIAM Journal on Computing, vol.10, issue.4, pp.713-717, 1981.
DOI : 10.1137/0210054

V. Kann, Maximum bounded 3-dimensional matching is MAX SNP-complete, Information Processing Letters, vol.37, issue.1, pp.27-35, 1991.
DOI : 10.1016/0020-0190(91)90246-E

P. [. Modiano and . Lin, Traffic grooming in WDM networks, IEEE Communications Magazine, vol.39, issue.7, pp.124-129, 2001.
DOI : 10.1109/35.933446