Combinatorial optimization in networks with shared risk link groups
From MaRDI portal
Recommendations
Cited in
(18)- Using shared risk link groups to enhance backup path computation
- Risk transportation via a clique number problem formulation.
- Refined parameterizations for computing colored cuts in edge-colored graphs
- Colored cut games
- Finding disjoint paths in networks with star shared risk link groups
- SRG-disjoint design with dedicated and shared protection
- Sequence hypergraphs
- Refined parameterizations for computing colored cuts in edge-colored graphs
- SRLG failure localization using nested m-trails and their application to adaptive probing
- Shared Risk Link Group disjointness and geodiverse routing: A trade‐off between benefit and practical effort
- New algorithms for the minimum coloring cut problem
- Colored cut games
- Solving the minimum labeling global cut problem by mathematical programming
- A short proof and experimental study of the approximation algorithm for label s-t cut
- A multicast problem with shared risk cost
- Bounds of redundant multicast routing problem with SRLG-diverse constraints: edge, path and tree models
- A short proof and experimental study of the approximation algorithm for label s-t Cut
- Graph transformation approaches for diverse routing in shared risk resource group (SRRG) failures
This page was built for publication: Combinatorial optimization in networks with shared risk link groups
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2965980)
