An Optimally-Competitive Algorithm for Maximum Online Perfect Bipartite Matching with i.i.d. Arrivals

Minjun Chang, Dorit S. Hochbaum, Quico Spaen, Mark Velednitsky. An Optimally-Competitive Algorithm for Maximum Online Perfect Bipartite Matching with i.i.d. Arrivals. Theory Comput. Syst., 64(4):645-661, 2020. [doi]

Authors

Minjun Chang

This author has not been identified. Look up 'Minjun Chang' in Google

Dorit S. Hochbaum

This author has not been identified. Look up 'Dorit S. Hochbaum' in Google

Quico Spaen

This author has not been identified. Look up 'Quico Spaen' in Google

Mark Velednitsky

This author has not been identified. Look up 'Mark Velednitsky' in Google