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

Publikationsart: Konferenzbeiträge
Titel: An approximation algorithm for network flow interdiction with unit costs and two capacities
Medien: Graphs and Combinatorial Optimization: from Theory to Applications (CTW2020 Proceedings)
DOI: 10.1007/978-3-030-63072-0_13
Band: 5
Autoren: M.Sc. Jan Boeckmann, Prof. Dr. Clemens Thielen
Herausgeber: Springer
Seiten: 157-169
Veröffentlichungsdatum: 16.09.2020
Zitation: 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