Pages that link to "Item:Q2056900"
From MaRDI portal
The following pages link to An approximation algorithm for network flow interdiction with unit costs and two capacities (Q2056900):
Displaying 7 items.
- Analysis of budget for interdiction on multicommodity network flows (Q513161) (← links)
- Network flow interdiction on planar graphs (Q987697) (← links)
- Interdicting Structured Combinatorial Optimization Problems with {0, 1}-Objectives (Q2976146) (← links)
- Approximation algorithm for maximum flow network interdiction problem (Q3389526) (← links)
- Hardness and approximation for network flow interdiction (Q4638580) (← links)
- Shortest path interdiction problem with convex piecewise-linear costs (Q6080429) (← links)
- A \((B + 1)\)-approximation for network flow interdiction with unit costs (Q6558673) (← links)