Matthew Fahrbach, Vahab S. Mirrokni, Morteza Zadimoghaddam. Submodular Maximization with Nearly Optimal Approximation, Adaptivity and Query Complexity. 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 255-273, SIAM, 2019. [doi]
@inproceedings{FahrbachMZ19,
title = {Submodular Maximization with Nearly Optimal Approximation, Adaptivity and Query Complexity},
author = {Matthew Fahrbach and Vahab S. Mirrokni and Morteza Zadimoghaddam},
year = {2019},
doi = {10.1137/1.9781611975482.17},
url = {https://doi.org/10.1137/1.9781611975482.17},
researchr = {https://researchr.org/publication/FahrbachMZ19},
cites = {0},
citedby = {0},
pages = {255-273},
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},
}