Daniel Dadush. On approximating the covering radius and finding dense lattice subspaces. In Moses Charikar, Edith Cohen, editors, Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing, STOC 2019, Phoenix, AZ, USA, June 23-26, 2019. pages 1021-1026, ACM, 2019. [doi]
@inproceedings{Dadush19,
title = {On approximating the covering radius and finding dense lattice subspaces},
author = {Daniel Dadush},
year = {2019},
doi = {10.1145/3313276.3316397},
url = {https://doi.org/10.1145/3313276.3316397},
researchr = {https://researchr.org/publication/Dadush19},
cites = {0},
citedby = {0},
pages = {1021-1026},
booktitle = {Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing, STOC 2019, Phoenix, AZ, USA, June 23-26, 2019},
editor = {Moses Charikar and Edith Cohen},
publisher = {ACM},
isbn = {978-1-4503-6705-9},
}