Browsing by Subject "NP-Hardness"
Now showing items 1-1 of 1
-
(2012-12-10)Geometric covering problems have always been of focus in computer scientific research. The generic geometric covering problem asks to cover a set S of n objects with another set of objects whose cardinality is minimum, in ...