Disk covering problem r(25)r(25)

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

Lower bound: Unknown
Upper bound: 16+3\frac{1}{\sqrt{6}+\sqrt{3}} (≈0.2391463)

Updates