Adaptive network flow with $k$-Arc Destruction
Résumé
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$.
| Origine | Fichiers produits par l'(les) auteur(s) |
|---|
Loading...