The complexity of computing a robust flow
From MaRDI portal
Publication:2294522
DOI10.1016/J.ORL.2019.10.012OpenAlexW2985811808MaRDI QIDQ2294522FDOQ2294522
Authors: Y. Disser, Jannik Matuschke 
Publication date: 11 February 2020
Published in: Operations Research Letters (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1704.08241
Cites Work
- Network flows. Theory, algorithms, and applications.
- Geometric algorithms and combinatorial optimization
- The directed subgraph homeomorphism problem
- Robust discrete optimization and network flows
- Deterministic network interdiction
- On multiroute maximum flows in networks.
- Maximizing residual flow under an arc destruction
- The maximum residual flow problem: NP‐hardness with two‐arc destruction
- On the power of randomization in network interdiction
- Robust and Adaptive Network Flows
- Protection of flows under targeted attacks
- Parametric multiroute flow and its application to multilink-attack network
- Hardness and approximation for network flow interdiction
- Robust flows over time: models and complexity results
- Title not available (Why is that?)
Cited In (9)
- A \((B + 1)\)-approximation for network flow interdiction with unit costs
- Decomposition of probability marginals for security games in abstract networks
- Rerouting Flows when Links Fail
- Constrained flows in networks
- Complexity of a classical flow restoration problem
- The complexity of flow on fat terrains and its i/o-efficient computation
- Probability Distributions on Partially Ordered Sets and Network Interdiction Games
- Algorithmic results for potential‐based flows: Easy and hard cases
- Title not available (Why is that?)
This page was built for publication: The complexity of computing a robust flow
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2294522)
