Disk covering problem $r(18)$
The smallest value $r(18)$ such that $18$ disks of radius $r(18)$ can be arranged to cover the unit disk.
Lower bound:
Unknown
Upper bound:
${\approx}0.290$
Updates
-
2018
Upper bound: ${\approx}0.290$
Jeremy Tan in 2018
[via Circles Covering Circles, Erich Friedman]