A LOWER BOUND ON THE AREA OF A 3-COLOURED DISK PACKING
A LOWER BOUND ON THE AREA OF A 3-COLOURED DISK PACKING
Given a set of unit disks in the plane with union area A, what fraction of A can be covered by selecting a pairwise disjoint subset of the disks? Rado conjectured 1/4 and proved 1/4.41. Motivated by the problem of channel assignment for wireless access points, in which use of …