Given a set of unit-discs in the plane with union area A, what fraction of A can be covered by selecting a pairwise disjoint subset of the discs? Rado conjectured
Peter Brass, Ferran Hurtado, Benjamin J. Lafrenier...
Improving on a recent breakthrough of Sharir, we find two minimum-radius circular disks covering a planar point set, in randomized expected time O(n log2 n).
In our problem we are given a set of customers, their positions on the plane and their demands. Geometrically, the area covered by a directional antenna with parameters , ,
Piotr Berman, Jieun K. Jeong, Shiva Prasad Kasivis...