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