Fractional routing using pairs of failure-disjoint paths
DOI10.1016/J.DAM.2011.12.019zbMATH Open1326.90011OpenAlexW2052407884MaRDI QIDQ496701FDOQ496701
Authors: Walid Ben-Ameur, Michał Pióro, Mateusz Żotkiewicz 
Publication date: 22 September 2015
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.dam.2011.12.019
Recommendations
- The fractional congestion bound for efficient edge disjoint routing
- Disjoint-paths and fault-tolerant routing on recursive dual-net
- Routing in hypercube networks with a constant fraction of faulty nodes
- Distributed routing in a fault-tolerant multistage interconnection network
- Fault-tolerant routings in double fixed-step networks
- Optimal routing with failure-independent path protection
- Probability-based fault-tolerant routing in hypercubes
- Fault-tolerant routing in hypercubes using probability vectors
Programming involving graphs or networks (90C35) Reliability, availability, maintenance, inspection in operations research (90B25) Stochastic network models in operations research (90B15)
Cites Work
- Network flows. Theory, algorithms, and applications.
- Emergence of Scaling in Random Networks
- Title not available (Why is that?)
- Title not available (Why is that?)
- Design of Survivable Networks: A survey
- Title not available (Why is that?)
- A quick method for finding shortest pairs of disjoint paths
- On multiroute maximum flows in networks.
- Title not available (Why is that?)
- A factor 2 approximation algorithm for the generalized Steiner network problem
- On the minimum cost multiple-source unsplittable flow problem
- Linear approximations in a dynamic programming approach for the uncapacitated single-source minimum concave cost network flow problem in acyclic networks.
Cited In (3)
Uses Software
This page was built for publication: Fractional routing using pairs of failure-disjoint paths
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q496701)
