A New Bound for Hadwiger’s Covering Problem in \(\boldsymbol{\mathbb{E}}^3\)
From MaRDI portal
Publication:5883269
DOI10.1137/22M1490314MaRDI QIDQ5883269
Publication date: 30 March 2023
Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)
linear programming; convex body; covering number; illumination number; illumination problem; covering by smaller homothetic copies
90C05: Linear programming
52A40: Inequalities and extremum problems involving convexity in convex geometry
52A37: Other problems of combinatorial convexity
52C17: Packing and covering in (n) dimensions (aspects of discrete geometry)
52A15: Convex sets in (3) dimensions (including convex surfaces)
Uses Software
