Login / Signup
Augment or Push: A Computational Study of Bipartite Matching and Unit-Capacity Flow Algorithms.
Boris V. Cherkassky
Andrew V. Goldberg
Paul Martin
Published in:
ACM J. Exp. Algorithmics (1998)
Keyphrases
</>
learning algorithm
bipartite matching
probabilistic model
optimization problems
data structure
computational complexity
np hard
supervised learning
worst case
combinatorial optimization problems
maximum flow
minimum cost flow