An approximation algorithm for network flow interdiction with unit costs and two capacities

DOI10.1007/978-3-030-63072-0_13zbMath1479.90043OpenAlexW3135388429MaRDI QIDQ2056900

Clemens Thielen, Jan Boeckmann

Publication date: 8 December 2021

Full work available at URL: https://doi.org/10.1007/978-3-030-63072-0_13

zbMATH Keywords

approximation algorithmnetwork flow interdictiontwo capacities

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Deterministic network models in operations research (90B10) Approximation algorithms (68W25)

Related Items (1)

Shortest path interdiction problem with convex piecewise-linear costs

Cites Work

• Deterministic network interdiction
• Interdicting Structured Combinatorial Optimization Problems with {0, 1}-Objectives
• Hardness and approximation for network flow interdiction
• The network inhibition problem
• Removing Arcs from a Network
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: An approximation algorithm for network flow interdiction with unit costs and two capacities