Login / Signup
An Optimally-Competitive Algorithm for Maximum Online Perfect Bipartite Matching with i.i.d. Arrivals.
Minjun Chang
Dorit S. Hochbaum
Quico Spaen
Mark Velednitsky
Published in:
Theory Comput. Syst. (2020)
Keyphrases
</>
bipartite matching
computational complexity
worst case
optimal solution
dynamic programming
search space
optimization algorithm
maximum weight
np hard
genetic algorithm
cost function
supervised learning
graphical models
graph structure
online algorithms
minimum weight