Computing the covering radius of a polytope with an application to lonely runners
From MaRDI portal
Publication:6349855
DOI10.1007/s00493-020-4633-8zbMath1524.11131arXiv2009.12080MaRDI QIDQ6349855
Matthias Schymura, Márton Naszódi, Romanos-Diogenes Malikiosis, Jana Cslovjecsek
Publication date: 25 September 2020
Computational aspects related to convexity (52B55) Packing and covering in (n) dimensions (aspects of discrete geometry) (52C17) Lattice packing and covering (number-theoretic aspects) (11H31) Diophantine inequalities (11J25)
This page was built for publication: Computing the covering radius of a polytope with an application to lonely runners