Pages that link to "Item:Q4638580"
From MaRDI portal
The following pages link to Hardness and approximation for network flow interdiction (Q4638580):
Displaying 26 items.
- Analysis of budget for interdiction on multicommodity network flows (Q513161) (← links)
- On short paths interdiction problems: Total and node-wise limited interdiction (Q929289) (← links)
- Network flow interdiction on planar graphs (Q987697) (← links)
- Filtering undesirable flows in networks (Q1699751) (← links)
- Protection of flows under targeted attacks (Q1727948) (← links)
- Parametric multiroute flow and its application to multilink-attack network (Q1751172) (← links)
- Blocking optimal structures (Q1752656) (← links)
- An approximation algorithm for network flow interdiction with unit costs and two capacities (Q2056900) (← links)
- Interdicting facilities in tree networks (Q2121611) (← links)
- The maximum flow network interdiction problem: valid inequalities, integrality gaps, and approximability (Q2270321) (← links)
- The complexity of computing a robust flow (Q2294522) (← links)
- On the hardness of approximating the min-hack problem (Q2569170) (← links)
- Preventing small \(\mathbf{(s,t)} \)-cuts by protecting edges (Q2672432) (← links)
- Theoretical and computational advances for network diversion (Q2811311) (← links)
- Interdicting Structured Combinatorial Optimization Problems with {0, 1}-Objectives (Q2976146) (← links)
- Approximation algorithm for maximum flow network interdiction problem (Q3389526) (← links)
- Symmetric interdiction for matching problems (Q5002612) (← links)
- (Q5009502) (← links)
- Maximizing Convergence Time in Network Averaging Dynamics Subject to Edge Removal (Q5051378) (← links)
- A Progressive Approximation Approach for the Exact Solution of Sparse Large-Scale Binary Interdiction Games (Q5085997) (← links)
- A Scalable Lower Bound for the Worst-Case Relay Attack Problem on the Transmission Grid (Q5106423) (← links)
- Rerouting Flows when Links Fail (Q5128505) (← links)
- Vertex downgrading to minimize connectivity (Q6038644) (← links)
- On the minimum \(s-t\) cut problem with budget constraints (Q6120941) (← links)
- A \((B + 1)\)-approximation for network flow interdiction with unit costs (Q6558673) (← links)
- An exact method for nonlinear network flow interdiction problems (Q6644845) (← links)
