disk packing

Given a unit disk, find the smallest radius r(n) required for n equal disks to completely cover the unit disk. The first few such values are

circle covering | five disks problem