Adaptive network flow with $k$-Arc Destruction - Archive ouverte HAL Access content directly
Preprints, Working Papers, ... Year :

Adaptive network flow with $k$-Arc Destruction

(1) , (2, 3) , (4) , (1)
1
2
3
4

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$.
Fichier principal
Vignette du fichier
1711.00831.pdf (110.34 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

hal-02440948 , version 1 (09-03-2020)

Identifiers

Cite

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

Altmetric

Share

Gmail Facebook Twitter LinkedIn More