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]
@article{ChangHSV20,
title = {An Optimally-Competitive Algorithm for Maximum Online Perfect Bipartite Matching with i.i.d. Arrivals},
author = {Minjun Chang and Dorit S. Hochbaum and Quico Spaen and Mark Velednitsky},
year = {2020},
doi = {10.1007/s00224-019-09947-7},
url = {https://doi.org/10.1007/s00224-019-09947-7},
researchr = {https://researchr.org/publication/ChangHSV20},
cites = {0},
citedby = {0},
journal = {Theory Comput. Syst.},
volume = {64},
number = {4},
pages = {645-661},
}