On approximating the covering radius and finding dense lattice subspaces

DOI10.1145/3313276.3316397zbMath1433.68488OpenAlexW2949332444MaRDI QIDQ5212842

Daniel Dadush

Publication date: 30 January 2020

Published in: Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing (Search for Journal in Brave)

Full work available at URL: https://ir.cwi.nl/pub/28779

zbMATH Keywords

integer programminglattice problemsKannan-Lovász conjecture

Mathematics Subject Classification ID

Lattices and convex bodies in (n) dimensions (aspects of discrete geometry) (52C07) Integer programming (90C10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Approximation algorithms (68W25)

This page was built for publication: On approximating the covering radius and finding dense lattice subspaces