Finding disjoint paths in networks with star shared risk link groups, Theoretical Computer Science, vol.579, pp.74-87, 2015. ,
DOI : 10.1016/j.tcs.2015.02.012
URL : https://hal.archives-ouvertes.fr/hal-01132216
Paths and cycles in colored graphs, Australasian Journal of Combinatorics, vol.31, pp.299-311, 2005. ,
The labeled maximum matching problem, Computers & Operations Research, vol.36, issue.6, pp.1859-1871, 2009. ,
DOI : 10.1016/j.cor.2008.05.012
The Next Wave on Computing, Optimization, and Decision Technologies, chapter Metaheuristics comparison for the minimum labelling spanning tree problem, pp.93-106, 2005. ,
Heuristic approaches for the Minimum Labelling Hamiltonian Cycle Problem, Electronic Notes in Discrete Mathematics, vol.25, pp.131-138, 2006. ,
DOI : 10.1016/j.endm.2006.06.080
Extensions of the minimum labelling spanning tree problem, Journal of Telecommunications and Information Technology, vol.4, pp.39-45, 2006. ,
The minimum labeling spanning trees, Information Processing Letters, vol.63, issue.5, pp.277-282, 1997. ,
DOI : 10.1016/S0020-0190(97)00127-0
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
Labeled Traveling Salesman Problems: Complexity and approximation, Discrete Optimization, vol.7, issue.1-2, pp.74-85, 2010. ,
DOI : 10.1016/j.disopt.2010.02.003
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
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
A graph theoretic model for complex network failure scenarios, INFORMS Telecommunications Conference, 2006. ,
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
A new shared-risk link groups (SRLG)-disjoint path provisioning with shared protection in WDM optical networks, Journal of Network and Computer Applications, vol.30, issue.2, pp.650-661, 2007. ,
DOI : 10.1016/j.jnca.2005.12.005
The Complexity of Bottleneck Labeled Graph Problems, International Workshop on Graph-Theoretic Concepts in Computer Science (WG), pp.328-340, 2007. ,
DOI : 10.1007/978-3-540-74839-7_31
URL : https://hal.archives-ouvertes.fr/hal-00917828
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
Diverse routing in mesh optical networks, IEEE Transactions on Communications, vol.51, pp.489-494, 2003. ,
Two formal analyses of attack graphs, Proceedings 15th IEEE Computer Security Foundations Workshop. CSFW-15, pp.49-63, 2002. ,
DOI : 10.1109/CSFW.2002.1021806
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
Diverse routing based on shared risk link groups, 2009 7th International Workshop on Design of Reliable Communication Networks, pp.153-159, 2009. ,
DOI : 10.1109/DRCN.2009.5340011
p-Cycle Design in Survivable WDM Networks with Shared Risk Link Groups (SRLGs), International Conference on Design of Reliable Communication Networks (DRCN), pp.207-212, 2005. ,
DOI : 10.1007/s11107-005-7357-1
Diverse routing in WDM optical networks with shared risk link group (SRLG) failures, International Conference on Design of Reliable Communication Networks (DRCN), pp.445-452, 2005. ,
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
Reliable Routings in Networks With Generalized Link Failure Events, IEEE/ACM Transactions on Networking, vol.16, issue.6, pp.1331-1339, 2008. ,
DOI : 10.1109/TNET.2007.911435
A quick Method for Finding Shortest Pairs of Disjoint Paths. Networks, pp.325-336, 1984. ,
Approximating Minimum Label s-t Cut via Linear Programming, Latin American Symposium on Theoretical Informatics, pp.655-666, 2012. ,
DOI : 10.1007/978-3-642-29344-3_55
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
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
Partial disjoint path for multi-layer protection in GMPLS networks, DRCN 2005). Proceedings.5th International Workshop on Design of Reliable Communication Networks, 2005., pp.165-170, 2005. ,
DOI : 10.1109/DRCN.2005.1563861
Optimisation des réseaux de télécommunication : Réseaux multi-niveaux, Tolérance aux pannes et Surveillance du trafic, 2006. ,
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
Novel algorithms for shared segment protection, IEEE Journal on Selected Areas in Communications, vol.21, issue.8, pp.1320-1331, 2003. ,
Trap avoidance and protection schemes in networks with shared risk link groups, IEEE/OSA Journal of Lightwave technology, vol.21, issue.11, pp.2683-2693, 2003. ,
Failure protection in layered networks with shared risk link groups, IEEE Network, vol.18, issue.3, pp.36-41, 2004. ,
Minimum-color path problems for reliability in mesh networks, IEEE International Conference on Computer Communications (INFOCOM), pp.2658-2669, 2005. ,
Path-protection routing and wavelength assignment (RWA) in WDM mesh networks under duct-layer constraints, IEEE/ACM Transactions on Networking, vol.11, issue.2, pp.248-258, 2003. ,
DOI : 10.1109/TNET.2003.810313
Efficient Algorithms for the Label Cut Problems, Theory and Applications of Models of Computation (TAMC), pp.259-270978, 2014. ,
DOI : 10.1007/978-3-319-06089-7_18
Approximation and hardness results for label cut and??related problems, Journal of Combinatorial Optimization, vol.33, issue.1, pp.192-208 ,
DOI : 10.1007/s10878-009-9222-0
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