The Internet Archive has a preservation copy of this work in our general collections.
The file type is
Given a set D of unit disks in the Euclidean plane, we consider (i) the discrete unit disk cover (DUDC) problem and (ii) the rectangular region cover (RRC) problem. In the DUDC problem, for a given set P of points the objective is to select minimum cardinality subset D^* ⊆ D such that each point in P is covered by at least one disk in D^*. On the other hand, in the RRC problem the objective is to select minimum cardinality subset D^**⊆ D such that each point of a given rectangular region R isarXiv:1209.2951v1 fatcat:knrkk5vwvjezxny2677ygodth4