R. Bhandari, Survivable Networks: Algorithms for Diverse Routing, Kluwer Academic, 1999.

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), pp.345-353, 2000.

R. Chang and S. Leu, The minimum labeling spanning trees, Information Processing Letters, vol.63, issue.5, pp.277-282, 1997.
DOI : 10.1016/S0020-0190(97)00127-0

A. L. Chiu, J. Strand, and R. Tkach, Issues for routing in the optical layer, IEEE Communications Magazine, vol.39, issue.2, pp.81-87, 2001.

P. Datta and A. K. Somani, Diverse routing for shared risk resource groups (SRRG) failures in WDM optical networks, First International Conference on Broadband Networks, pp.120-129, 2004.
DOI : 10.1109/BROADNETS.2004.34

I. Dinur and S. Safra, On the hardness of approximating label-cover, Information Processing Letters, vol.89, issue.5, pp.247-254, 2004.
DOI : 10.1016/j.ipl.2003.11.007

A. Faragó, A graph theoretic model for complex network failure scenarios, Proceedings of the Eighth INFORMS Telecommunications Conference, 2006.

A. Frank, R. L. Graham, M. Grötschel, and L. , Connectivity and Network Flows, volume 1 of Handbook of combinatorics, chapter 2, 1995.

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

J. Hastad, 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. Q. Hu, Diverse routing in mesh optical networks, IEEE Transactions on Communications, vol.51, issue.3, pp.489-494, 2003.

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

D. R. Karger, Global min-cuts in rnc and other ramifications of a simple mincut algorithm, Proceedings of he fourth annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pp.21-30, 1993.

S. O. Krumke and H. Wirth, On the minimum label spanning tree problem, Information Processing Letters, vol.66, issue.2, pp.81-85, 1998.
DOI : 10.1016/S0020-0190(98)00034-9

G. Mohan and C. S. Murthy, Lightpath restoration in WDM optical networks, IEEE Network, vol.14, issue.6, pp.24-32, 2000.

D. Papadimitriou, F. Poppe, J. Jones, S. Venkatachalam, S. Dharanikota et al., Inference of shared risk link groups. IETF Draft, OIF Contribution, pp.2001-066

R. Rizzi, NOTE - On Minimizing Symmetric Set Functions, Combinatorica, vol.20, issue.3, 1999.
DOI : 10.1007/s004930070017

P. Sebos, J. Yates, G. Hjlmtsson, and A. Greenberg, Auto-discovery of shared risk link groups, OFC 2001. Optical Fiber Communication Conference and Exhibit. Technical Digest Postconference Edition (IEEE Cat. 01CH37171), pp.3-4, 2001.
DOI : 10.1109/OFC.2001.928453

V. V. Vazirani, Approximation Algorithms, 2002.
DOI : 10.1007/978-3-662-04565-7

Y. Wan, G. Chen, and Y. Xu, A note on the minimum label spanning tree, Information Processing Letters, vol.84, issue.2, pp.99-101, 2002.
DOI : 10.1016/S0020-0190(02)00230-2

H. Wirth, Multicriteria Approximation of Network Design and Network Upgrade Problems, 2001.

S. Yuan, S. Varma, and J. P. Jue, Minimum-color path problems for reliability in mesh networks, Proceedings of IEEE InfoCom, pp.2658-2669, 2005.