Computational approaches to lattice packing and covering problems
From MaRDI portal
Publication:818684
DOI10.1007/s00454-005-1202-2zbMath1091.52009arXivmath/0403272MaRDI 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
covering; packing; Delone triangulation; determinant maximization problem; semidefinite programming problem; Voronoi's reduction theory
90C22: Semidefinite programming
52C07: Lattices and convex bodies in (n) dimensions (aspects of discrete geometry)
52C17: Packing and covering in (n) dimensions (aspects of discrete geometry)
Related Items