Algorithms and Complexity for the Almost Equal Maximum Flow Problem.
Rebekka HaeseTill HellerSven O. KrumkePublished in: CoRR (2021)
Keyphrases
- computational cost
- theoretical analysis
- learning algorithm
- computational complexity
- computational issues
- maximum flow
- simplex algorithm
- worst case
- space complexity
- data sets
- orders of magnitude
- graph theory
- computationally efficient
- complexity analysis
- memory requirements
- recently developed
- optimization problems
- significant improvement
- reinforcement learning
- decision trees
- neural network