Prefer a chat interface with context about you and your work?
On Line-Separable Weighted Unit-Disk Coverage and Related Problems
Given a set $P$ of $n$ points and a set $S$ of $n$ weighted disks in the plane, the disk coverage problem is to compute a subset of disks of smallest total weight such that the union of the disks in the subset covers all points of $P$. The problem …