Login / Signup
Online bipartite matching with amortized $O(\log^2 n)$ replacements.
Aaron Bernstein
Jacob Holm
Eva Rotenberg
Published in:
CoRR (2017)
Keyphrases
</>
bipartite matching
worst case
online learning
maximum weight
genetic algorithm
online algorithms
minimum cost flow
search tree
graph cuts