HAL will be down for maintenance from Friday, June 10 at 4pm through Monday, June 13 at 9am. More information
Skip to Main content Skip to Navigation
Preprints, Working Papers, ...

Adaptive network flow with $k$-Arc Destruction

Thomas Ridremont 1 Dimitri Watel 2, 3 Pierre-Louis Poirion 4 Christophe Picouleau 1
1 CEDRIC - OC - CEDRIC. Optimisation Combinatoire
CEDRIC - Centre d'études et de recherche en informatique et communications
2 METHODES-SAMOVAR - Méthodes et modèles pour les réseaux
SAMOVAR - Services répartis, Architectures, MOdélisation, Validation, Administration des Réseaux
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$.
Complete list of metadata

Cited literature [5 references]  Display  Hide  Download

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

File

1711.00831.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : hal-02440948, version 1
  • ARXIV : 1711.00831

Citation

Thomas Ridremont, Dimitri Watel, Pierre-Louis Poirion, Christophe Picouleau. Adaptive network flow with $k$-Arc Destruction. 2020. ⟨hal-02440948⟩

Share

Metrics

Record views

64

Files downloads

21