A (B + 1)-approximation for network flow interdiction with unit costs
From MaRDI portal
Publication:6558673
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
- scientific article; zbMATH DE number 3174052 (Why is no real title available?)
- scientific article; zbMATH DE number 2050722 (Why is no real title available?)
- Almost-polynomial ratio ETH-hardness of approximating densest k-subgraph
- An approximation algorithm for network flow interdiction with unit costs and two capacities
- Bulk-robust combinatorial optimization
- Detecting high log-densities, an \(O(n^{1/4})\) approximation for densest \(k\)-subgraph
- Deterministic network interdiction
- Hardness and approximation for network flow interdiction
- Matching interdiction
- Max flows in \(O(nm)\) time, or better
- Network flows. Theory, algorithms, and applications.
- On the \(p\)-hub interdiction problem
- Removing Arcs from a Network
- Robust and adaptive network flows
- Solving the bi-objective maximum-flow network-interdiction problem
- The bicriterion maximum flow network interdiction problem in \(s\)-\(t\)-planar graphs
- The complexity of computing a robust flow
- The multi-terminal maximum-flow network-interdiction problem
- The network inhibition problem
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)
