G. Ausiello, A. D. Atri, and M. Protasi, Structure preserving reductions among convex optimization problems, Journal of Computer and System Sciences, vol.21, issue.1, pp.136-153, 1980.
DOI : 10.1016/0022-0000(80)90046-X
URL : http://doi.org/10.1016/0022-0000(80)90046-x

R. Bhandari, Survivable Networks: Algorithms for Diverse Routing, 1998.

A. Björklund, T. Husfeldt, and M. Koivisto, Set Partitioning via Inclusion-Exclusion, SIAM Journal on Computing, vol.39, issue.2, pp.546-563, 2009.
DOI : 10.1137/070683933

H. Broersma, X. Li, G. Woeginger, and S. Zhang, Paths and cycles in colored graphs, Australas. J. Combin, vol.31, pp.299-311, 2005.

R. D. Carr, S. Doddi, G. Konjevod, and M. Marathe, On the red-blue set cover problem, Proceedings of the Eleventh Annual ACM-SIAM Symposium on Discrete Algorithms, SODA '00, pp.345-353, 2000.

V. T. Chakaravarthy, New results on the computability and complexity of points?to analysis, ACM SIGPLAN-SIGACT symposium on principles of programming languages (POPL), pp.115-125, 2003.

D. Coudert, P. Datta, S. Perennes, H. Rivano, and M. Voge, SHARED RISK RESOURCE GROUP COMPLEXITY AND APPROXIMABILITY ISSUES, Parallel Processing Letters, vol.17, issue.02, pp.169-184, 2007.
DOI : 10.1142/S0129626407002958
URL : https://hal.archives-ouvertes.fr/hal-00371100

D. Coudert, S. Pérennes, H. Rivano, and M. Voge, Combinatorial optimization in networks with Shared Risk Link Groups, 2014.
URL : https://hal.archives-ouvertes.fr/hal-01053859

P. Datta and A. Somani, Graph transformation approaches for diverse routing in shared risk resource group (SRRG) failures, Computer Networks, vol.52, issue.12, pp.2381-2394, 2008.
DOI : 10.1016/j.comnet.2008.04.017

J. Doucette and W. Grover, Shared-Risk Logical Span Groups in Span-Restorable Optical Networks: Analysis and Capacity Planning Model, Photonic Network Communications, vol.18, issue.10, pp.35-53, 2005.
DOI : 10.1007/s11107-005-4530-5

R. G. Downey and M. R. Fellows, Fixed-parameter tractability and completeness II: On completeness for W[1], Theoretical Computer Science, vol.141, issue.1-2, pp.109-131, 1995.
DOI : 10.1016/0304-3975(94)00097-3

R. G. Downey and M. R. Fellows, Fundamentals of Parameterized Complexity. Texts in Computer Science, 2013.

A. Faragó, A graph theoretic model for complex network failure scenarios, 8th INFORMS Telecommunications Conference, 2006.

M. R. Fellows, J. Guob, and I. Kanj, The parameterized complexity of some minimum label problems, Journal of Computer and System Sciences, vol.76, issue.8, pp.727-740, 2010.
DOI : 10.1016/j.jcss.2010.02.012

L. R. Ford and D. R. Fulkerson, A simple algorithm for finding maximal network flows and an application to the Hitchcock problem, Journal canadien de math??matiques, vol.9, issue.0, pp.210-218, 1957.
DOI : 10.4153/CJM-1957-024-0

M. Garey and D. Johnson, Computers and Intractability: A Guide to the theory of NPcompleteness, Freeman NY, 1979.

L. Guo and L. Li, A Novel Survivable Routing Algorithm With Partial Shared-Risk Link Groups (SRLG)-Disjoint Protection Based on Differentiated Reliability Constraints in WDM Optical Mesh Networks, Journal of Lightwave Technology, vol.25, issue.6, pp.1410-1415, 2007.
DOI : 10.1109/JLT.2007.896772

R. Hassin, J. Monnot, and D. Segev, Approximation algorithms and hardness results for??labeled connectivity problems, Journal of Combinatorial Optimization, vol.33, issue.1, pp.437-453, 2007.
DOI : 10.1007/s10878-007-9044-x
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.118.6675

J. Hopcroft and R. Tarjan, Algorithm 447: efficient algorithms for graph manipulation, Communications of the ACM, vol.16, issue.6, pp.372-378, 1973.
DOI : 10.1145/362248.362272

J. Håstad, Clique is hard to approximate within n/sup 1-??/, Proceedings of 37th Conference on Foundations of Computer Science, pp.105-142, 1999.
DOI : 10.1109/SFCS.1996.548522

J. Hu, Diverse routing in mesh optical networks, IEEE Transactions on Communications, vol.51, pp.489-494, 2003.

Q. Jiang, D. Reeves, and P. Ning, Improving Robustness of PGP Keyrings by Conflict Detection, RSA Conference Cryptographers' Track (CT-RSA), pp.194-207, 2004.
DOI : 10.1007/978-3-540-24660-2_16

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

X. Luo and B. Wang, Diverse routing in WDM optical networks with shared risk link group (SRLG) failures, Proc. DRCN, pp.445-452, 2005.

R. Niedermeier, Invitation to fixed-parameter algorithms. Oxford lecture series in mathematics and its applications, 2006.

L. Shen, X. Yang, and B. Ramamurthy, Shared-risk link group (SRLG)-diverse path provisioning under hybrid service level agreements in wavelength-routed optical mesh networks: formulation and solution approaches, OptiComm 2003: Optical Networking and Communications, pp.918-931, 2005.
DOI : 10.1117/12.533306

J. W. Suurballe, Disjoint paths in a network, Networks, vol.19, issue.2, pp.125-145, 1974.
DOI : 10.1002/net.3230040204

J. W. Suurballe and R. E. Tarjan, A quick method for finding shortest pairs of disjoint paths, Networks, vol.3, issue.2, pp.325-336, 1984.
DOI : 10.1002/net.3230140209

S. Szeider, Finding paths in graphs avoiding forbidden transitions, Discrete Applied Mathematics, vol.126, issue.2-3, pp.261-273, 2003.
DOI : 10.1016/S0166-218X(02)00251-2

A. Todimala and B. Ramamurthy, IMSH: an iterative heuristic for SRLG diverse routing in WDM mesh networks, Proceedings. 13th International Conference on Computer Communications and Networks (IEEE Cat. No.04EX969), pp.199-204, 2004.
DOI : 10.1109/ICCCN.2004.1401627

A. Todimala and B. Ramamurthy, Survivable virtual topology routing under shared risk link groups in WDM networks, First International Conference on Broadband Networks, pp.130-139, 2004.
DOI : 10.1109/BROADNETS.2004.81

S. Yuan, S. Varma, and J. Jue, Minimum-color path problems for reliability in mesh networks, Proc. IEEE INFOCOM, pp.2658-2669, 2005.

Q. Zhang, J. Sun, G. Xiao, and E. Tsang, Evolutionary Algorithms Refining a Heuristic: A Hybrid Method for Shared-Path Protections in WDM Networks Under SRLG Constraints, IEEE Transactions on Systems, Man and Cybernetics, Part B (Cybernetics), vol.37, issue.1, pp.51-61, 2007.
DOI : 10.1109/TSMCB.2006.883269