Recommendations
- The bicriterion maximum flow network interdiction problem in \(s\)-\(t\)-planar graphs
- Hardness and approximation for network flow interdiction
- Interdiction problems on planar graphs
- Interdiction problems on planar graphs
- An approximation algorithm for network flow interdiction with unit costs and two capacities
Cites work
- scientific article; zbMATH DE number 26490 (Why is no real title available?)
- scientific article; zbMATH DE number 3558962 (Why is no real title available?)
- scientific article; zbMATH DE number 2050722 (Why is no real title available?)
- Clustering and domination in perfect graphs
- Combinatorial optimization. Polyhedra and efficiency (3 volumes)
- Deterministic network interdiction
- Finding the n Most Vital Links in Flow Networks
- Flow in Planar Graphs with Multiple Sources and Sinks
- Flow in planar graphs with vertex capacities
- Maximal Flow Through a Network
- Network flow interdiction on planar graphs
- Network flows. Theory, algorithms, and applications.
- Optimal interdiction of a supply network
- Optimal interdiction policy for a flow network
- Reformulation and sampling to solve a stochastic network interdiction problem
- Removing Arcs from a Network
- Stochastic network interdiction
- The network inhibition problem
Cited in
(38)- Minimum cost edge blocker clique problem
- Using edge contractions to reduce the semitotal domination number
- A \((B + 1)\)-approximation for network flow interdiction with unit costs
- Determining the most vital arcs on the shortest path for fire trucks in terrorist actions that will cause fire
- Vertex downgrading to minimize connectivity
- Exact algorithms for the minimum cost vertex blocker clique problem
- Maximum shortest path interdiction problem by upgrading edges on trees under weighted \(l_1\) norm
- Symmetric interdiction for matching problems
- scientific article; zbMATH DE number 2050722 (Why is no real title available?)
- Interdicting structured combinatorial optimization problems with {0,1}-objectives
- Connectivity interdiction
- On the hardness of covering-interdiction problems
- A mixed-integer programming approach for locating jamming devices in a flow-jamming attack
- Interdicting facilities in tree networks
- Matching interdiction
- Multilevel approaches for the critical node problem
- Network flow interdiction on planar graphs
- Maximum Capacity Path Interdiction Problem with Fixed Costs
- Bounds of spectral radii on edge-most outer-planar bipartite graphs
- A bi-level model and memetic algorithm for arc interdiction location-routing problem
- Interdiction problems on planar graphs
- Theoretical and computational advances for network diversion
- Interdiction problems on planar graphs
- Perfect matching interdiction problem restricted to a stable vertex
- 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
- Exact algorithms for solving a Euclidean maximum flow network interdiction problem
- The critical node game
- Maximum shortest path interdiction problem by upgrading edges on trees under Hamming distance
- Minimum \(d\)-transversals of maximum-weight stable sets in trees
- Network flows and non-guillotine cutting patterns
- Vertex control of flows in networks
- An accelerating algorithm for maximum shortest path interdiction problem by upgrading edges on trees under unit Hamming distance
- The complexity of blocking (semi)total dominating sets with edge contractions
- On designing networks resilient to clique blockers
- Analysis of budget for interdiction on multicommodity network flows
- Hardness and approximation for network flow interdiction
- A study of network violator interception based on a reliable game model
This page was built for publication: Network flow interdiction on planar graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q987697)
