1 paper
Logan Pedersen, Haitao Wang
Given a set P of n points and a set S of m weighted disks in the plane, the disk coverage problem asks for a subset of disks of minimum total weight that cover all points o…