Browsing Computer Science and Automation (CSA) by Subject "Multi-cover Problem"
Now showing items 1-1 of 1
-
Approximation Algorithms for Geometric Packing and Covering Problems
We study a host of geometric optimization problems that are NP-hard and design polynomial time approximation algorithms for them. More precisely, we are given a family of geometric objects and a point set, mostly in the ...