Randomized online algorithms for minimum metric bipartite matching.

Adam Meyerson Akash Nanavati Laura J. Poplawski

Published in: SODA (2006)

Keyphrases

online algorithms
bipartite matching
online learning
maximum weight
lower bound
minimum cost flow
learning algorithm
competitive ratio
worst case
average case
minimum cost
decision boundary
metric space
upper bound
asymptotically optimal
spanning tree
randomized algorithm
semi supervised
active learning
e learning