 |
Free and accessible knowledge |
Adaptive network flow with $k$-Arc Destruction
Abstract : When a flow is not allowed to be reoriented the Maximum Residual Flow Problem with $k$-Arc Destruction is known to be $NP$-hard for $k=2$. We show that when a flow is allowed to be adaptive the problem becomes polynomial for every fixed $k$.
Cited literature [5 references]
https://hal.archives-ouvertes.fr/hal-02440948
Contributor : Christophe Picouleau Connect in order to contact the contributor
Submitted on : Monday, March 9, 2020 - 4:01:44 PM
Last modification on : Monday, February 21, 2022 - 3:38:20 PM
Long-term archiving on: : Wednesday, June 10, 2020 - 3:45:15 PM
Contributor : Christophe Picouleau Connect in order to contact the contributor
Submitted on : Monday, March 9, 2020 - 4:01:44 PM
Last modification on : Monday, February 21, 2022 - 3:38:20 PM
Long-term archiving on: : Wednesday, June 10, 2020 - 3:45:15 PM
File
1711.00831.pdf
Files produced by the author(s)