Disk covering problem r(23)r(23)

The smallest value r(23)r(23) such that 2323 disks of radius r(23)r(23) can be arranged to cover the unit disk.

Lower bound: Unknown
Upper bound: ≈0.25{\approx}0.25

Updates