Covering cubes and the closest vector problem

Friedrich Eisenbrand, Nicolai Hähnle, Martin Niemeier. Covering cubes and the closest vector problem. In Ferran Hurtado, Marc J. van Kreveld, editors, Proceedings of the 27th ACM Symposium on Computational Geometry, Paris, France, June 13-15, 2011. pages 417-423, ACM, 2011. [doi]

@inproceedings{EisenbrandHN11,
  title = {Covering cubes and the closest vector problem},
  author = {Friedrich Eisenbrand and Nicolai Hähnle and Martin Niemeier},
  year = {2011},
  doi = {10.1145/1998196.1998264},
  url = {http://doi.acm.org/10.1145/1998196.1998264},
  researchr = {https://researchr.org/publication/EisenbrandHN11},
  cites = {0},
  citedby = {0},
  pages = {417-423},
  booktitle = {Proceedings of the 27th ACM Symposium on Computational Geometry, Paris, France, June 13-15, 2011},
  editor = {Ferran Hurtado and Marc J. van Kreveld},
  publisher = {ACM},
  isbn = {978-1-4503-0682-9},
}