A (B + 1)-approximation for network flow interdiction with unit costs
From MaRDI portal
Publication:6558673
DOI10.1016/J.DAM.2021.07.008zbMATH Open1548.90469MaRDI QIDQ6558673FDOQ6558673
Authors: Jan Boeckmann, Clemens Thielen 
Publication date: 20 June 2024
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Recommendations
- An approximation algorithm for network flow interdiction with unit costs and two capacities
- Hardness and approximation for network flow interdiction
- Approximation algorithm for maximum flow network interdiction problem
- scientific article; zbMATH DE number 2050722
- Network flow interdiction on planar graphs
Cites Work
- Network flows. Theory, algorithms, and applications.
- Title not available (Why is that?)
- Detecting high log-densities, an \(O(n^{1/4})\) approximation for densest \(k\)-subgraph
- Max flows in \(O(nm)\) time, or better
- Deterministic network interdiction
- Removing Arcs from a Network
- Matching interdiction
- Solving the bi-objective maximum-flow network-interdiction problem
- The network inhibition problem
- Title not available (Why is that?)
- Bulk-robust combinatorial optimization
- The multi-terminal maximum-flow network-interdiction problem
- Almost-polynomial ratio ETH-hardness of approximating densest k-subgraph
- On the \(p\)-hub interdiction problem
- Robust and adaptive network flows
- Hardness and approximation for network flow interdiction
- The bicriterion maximum flow network interdiction problem in \(s\)-\(t\)-planar graphs
- An approximation algorithm for network flow interdiction with unit costs and two capacities
- The complexity of computing a robust flow
This page was built for publication: A \((B + 1)\)-approximation for network flow interdiction with unit costs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6558673)
