1 paper · 1 filter
Jingchao Chen
The k-coverage problem is to find the minimum number of disks such that each point in a given plane is covered by at least k disks. Under unit disk condition, when k=1, this…