Before revision: Given a set of points P in L_2 , the classic Unit Covering (UC) problem asks to compute the minimum number of unit disks (possibly intersecting) required to cover the points in P, along with a placement of the disks.
After revision: Given a set of points P in the plane , the classic Unit Covering (UC) problem asks to compute the minimum number of unit disks (possibly intersecting) required to cover the points in P, along with a placement of the disks.