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