Buddhima Gamlath, Sagar Kale, Ola Svensson. Beating Greedy for Stochastic Bipartite Matching. In Timothy M. Chan, editor, Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2019, San Diego, California, USA, January 6-9, 2019. pages 2841-2854, SIAM, 2019. [doi]
@inproceedings{GamlathKS19,
title = {Beating Greedy for Stochastic Bipartite Matching},
author = {Buddhima Gamlath and Sagar Kale and Ola Svensson},
year = {2019},
doi = {10.1137/1.9781611975482.176},
url = {https://doi.org/10.1137/1.9781611975482.176},
researchr = {https://researchr.org/publication/GamlathKS19},
cites = {0},
citedby = {0},
pages = {2841-2854},
booktitle = {Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2019, San Diego, California, USA, January 6-9, 2019},
editor = {Timothy M. Chan},
publisher = {SIAM},
isbn = {978-1-61197-548-2},
}