Disk covering problem r(16)r(16)

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

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

Updates