Balanced network flows. V. Cycle-canceling algorithms.

Christian Fremuth-Paeger Dieter Jungnickel

Published in: Networks (2001)

Keyphrases

network flow
theoretical analysis
computational complexity
significant improvement
optimization problems
worst case
orders of magnitude
constraint satisfaction
times faster
min cost
data sets
feature selection
data structure
lower bound
computationally efficient