Name
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$. |
Year | Venue | Field |
|---|---|---|
2017 | arXiv: Combinatorics | Econometrics,Flow network,Discrete mathematics,Residual,Arc (geometry),Polynomial,Mathematical analysis,Flow (psychology),Mathematics |
DocType | Volume | Citations |
Journal | abs/1711.00831 | 0 |
PageRank | References | Authors |
0.34 | 0 | 4 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Thomas Ridremont | 1 | 0 | 0.68 |
| Dimitri Watel | 2 | 7 | 3.53 |
| Pierre-Louis Poirion | 3 | 24 | 7.43 |
| Christophe Picouleau | 4 | 0 | 0.68 |