Adaptive Network Flow with k-Arc Destruction
classification
🧮 math.CO
cs.DS
keywords
flowadaptivealloweddestructionproblemwhenbecomesevery
read the original 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$.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.