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

zbMATH Keywords

coveringpackingDelone triangulationdeterminant maximization problemsemidefinite programming problemVoronoi's reduction theory

Mathematics Subject Classification ID

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)

Uniformity of Point Samples in Metric Spaces Using Gap Ratio ⋮ Simultaneous packing and covering in sequence spaces ⋮ Random sequential covering ⋮ Multiple covers with balls. I: Inclusion-exclusion ⋮ Inhomogeneous extreme forms ⋮ \(\varepsilon\)-coverings of Hölder-Zygmund type spaces on data-defined manifolds ⋮ On the Voronoi Conjecture for Combinatorially Voronoi Parallelohedra in Dimension 5 ⋮ Covering and Packing with Spheres by Diagonal Distortion in ℝ n ⋮ A generalization of Voronoi's reduction theory and its application ⋮ Complexity and algorithms for computing Voronoi cells of lattices ⋮ Lattice packing and covering of convex bodies ⋮ Application of an idea of Voronoĭ to lattice packing ⋮ Application of an idea of Voronoĭ to lattice zeta functions ⋮ When is the ball a local pessimum for covering?

This page was built for publication: Computational approaches to lattice packing and covering problems