A lazy approach to on-line bipartite matching.

Jakub Kozik Grzegorz Matecki

Published in: CoRR (2014)

Keyphrases

bipartite matching
maximum weight
minimum cost flow
computational complexity
social networks
special case
graph cuts
random walk
partial order
graph theory