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

MLA

Minjun Chang, et al. DISPATCH: An Optimally-Competitive Algorithm for Maximum Online Perfect Bipartite Matching with i.i.d. Arrivals. Jan. 2018. EBSCOhost, https://doi.org/10.1007/978-3-030-04693-4_10.

APA

Minjun Chang, Quico Spaen, Dorit S. Hochbaum, & Mark Velednitsky. (2018). DISPATCH: An Optimally-Competitive Algorithm for Maximum Online Perfect Bipartite Matching with i.i.d. Arrivals. https://doi.org/10.1007/978-3-030-04693-4_10

Chicago

Minjun Chang, Quico Spaen, Dorit S. Hochbaum, and Mark Velednitsky. 2018. “DISPATCH: An Optimally-Competitive Algorithm for Maximum Online Perfect Bipartite Matching with i.i.d. Arrivals,” January. doi:10.1007/978-3-030-04693-4_10.