Computational approaches to lattice packing and covering problems
DOI10.1007/s00454-005-1202-2zbMath1091.52009arXivmath/0403272OpenAlexW2119637517MaRDI QIDQ818684
Achill Schürmann, Frank Vallentin
Publication date: 21 March 2006
Published in: Discrete \& Computational Geometry (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/math/0403272
coveringpackingDelone triangulationdeterminant maximization problemsemidefinite programming problemVoronoi's reduction theory
Semidefinite programming (90C22) Lattices and convex bodies in (n) dimensions (aspects of discrete geometry) (52C07) Packing and covering in (n) dimensions (aspects of discrete geometry) (52C17)
Related Items (14)
This page was built for publication: Computational approaches to lattice packing and covering problems