Aleksandar Nikolov. Randomized Rounding for the Largest Simplex Problem. In Rocco A. Servedio, Ronitt Rubinfeld, editors, Proceedings of the Forty-Seventh Annual ACM on Symposium on Theory of Computing, STOC 2015, Portland, OR, USA, June 14-17, 2015. pages 861-870, ACM, 2015. [doi]
@inproceedings{Nikolov15,
title = {Randomized Rounding for the Largest Simplex Problem},
author = {Aleksandar Nikolov},
year = {2015},
doi = {10.1145/2746539.2746628},
url = {http://doi.acm.org/10.1145/2746539.2746628},
researchr = {https://researchr.org/publication/Nikolov15},
cites = {0},
citedby = {0},
pages = {861-870},
booktitle = {Proceedings of the Forty-Seventh Annual ACM on Symposium on Theory of Computing, STOC 2015, Portland, OR, USA, June 14-17, 2015},
editor = {Rocco A. Servedio and Ronitt Rubinfeld},
publisher = {ACM},
isbn = {978-1-4503-3536-2},
}