Rerouting Flows when Links Fail
From MaRDI portal
Publication:5128505
DOI10.1137/18M1218273zbMath1450.05038arXiv1704.07067OpenAlexW3093372030MaRDI QIDQ5128505
Gianpaolo Oriolo, Jannik Matuschke, S. Thomas McCormick
Publication date: 27 October 2020
Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1704.07067
Small world graphs, complex networks (graph-theoretic aspects) (05C82) Deterministic network models in operations research (90B10) Graph algorithms (graph-theoretic aspects) (05C85) Flows in graphs (05C21)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Stable routing under the Spanning Tree Protocol
- Building edge-failure resilient networks
- Protection of flows under targeted attacks
- Robust flows over time: models and complexity results
- On the power of randomization in network interdiction
- The complexity of computing a robust flow
- Reserving Resilient Capacity in a Network
- On multiroute maximum flows in networks
- The Online Replacement Path Problem
- Single-Sink Multicommodity Flow with Side Constraints
- Multicommodity max-flow min-cut theorems and their use in designing approximation algorithms
- Length-Bounded Cuts and Flows
- Maximal, Lexicographic, and Dynamic Network Flows
- A generalization of max flow—min cut
- Maximizing residual flow under an arc destruction
- Hardness and approximation for network flow interdiction
- Robust and Adaptive Network Flows
