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

Title: An approximation algorithm for network flow interdiction with unit costs and two capacities
Media: Graphs and Combinatorial Optimization: from Theory to Applications (CTW2020 Proceedings)
DOI: 10.1007/978-3-030-63072-0_13
Volume: 5
Publisher: Springer
Pages: 157-169
Publication date: 16.09.2020
Citation: Boeckmann, Jan; Thielen, Clemens (2020): An approximation algorithm for network flow interdiction with unit costs and two capacities. Graphs and Combinatorial Optimization: from Theory to Applications (CTW2020 Proceedings) 5, S. 157-169. DOI: 10.1007/978-3-030-63072-0_13