Opening book details…
Can I read A (B+1)-approximation for network flow interdiction with unit costs on EtoBox?
A (B+1)-approximation for network flow interdiction with unit costs by Boeckmann, Jan (author);Thielen, Clemens (author) is a Computer Science article available to read on EtoBox.
What is A (B+1)-approximation for network flow interdiction with unit costs about?
In the network flow interdiction problem (NFI), an interdictor aims to remove arcs of total cost at most a given budget B from a network with given arc costs and capacities such that the value of a maximum flow from a source s to a sink t is minimized. We present a polynomial-time (B + 1)-approximation algorithm for NFI with unit arc costs, which is the first approximation algorithm for any variant of network flow interdiction whose approximation ratio only depends on the budget available to the interdictor, but not on the size of the network.
Who reads A (B+1)-approximation for network flow interdiction with unit costs?
It is typically read by researchers, students, and practitioners in Computer Science.
- Author
- Boeckmann, Jan (author);Thielen, Clemens (author)
- Publisher
- Elsevier BV
- Published
- 2024
- Language
- EN
- Field
- Computer Science (Physical Sciences)
More by Boeckmann, Jan (author);Thielen, Clemens (author)
Browse all works by Boeckmann, Jan (author);Thielen, Clemens (author)