On multi-path routing for reliable communications in failure interdependent complex networks
From MaRDI portal
Recommendations
- On interdependent failure resilient multi-path routing in smart grid communication network
- Optimal routing with failure-independent path protection
- Path Problems in Complex Networks
- On the complexity of resilient network design
- Branch-and-price-and-cut algorithms for solving the reliable \(h\)-paths problem
Cites work
- scientific article; zbMATH DE number 1600999 (Why is no real title available?)
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- A 3.4713-approximation algorithm for the capacitated multicast tree routing problem
- Algorithms and Computation
- An Improved Approximation Algorithm for the Capacitated Multicast Tree Routing Problem
- Completeness in standard and differential approximation classes: Poly-(D)APX- and (D)PTAS-completeness
- Computing and Combinatorics
- Linear degree extractors and the inapproximability of max clique and chromatic number
- On interdependent failure resilient multi-path routing in smart grid communication network
- Size-constrained tree partitioning: approximating the multicast k-tree routing problem
- Some Generalized Max-Flow Min-Cut Problems in the Plane
Cited in
(5)- Approximation algorithm for estimating failure probability of multipath transmission
- Optimal routing with failure-independent path protection
- Robust path choice in networks with failures
- On the Resiliency of Randomized Routing Against Multiple Edge Failures
- On interdependent failure resilient multi-path routing in smart grid communication network
This page was built for publication: On multi-path routing for reliable communications in failure interdependent complex networks
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2025105)
