Browsing Computer Science by Subject "PTAS"
Now showing items 1-2 of 2
-
Approximation Algorithms for Geometric Covering Problems for Disks and Squares
(University of Waterloo, 2013-08-15)Geometric covering is a well-studied topic in computational geometry. We study three covering problems: Disjoint Unit-Disk Cover, Depth-(≤ K) Packing and Red-Blue Unit-Square Cover. In the Disjoint Unit-Disk Cover ... -
Approximation Algorithms for Rectangle Piercing Problems
(University of Waterloo, 2005)Piercing problems arise often in facility location, which is a well-studied area of computational geometry. The general form of the piercing problem discussed in this dissertation asks for the minimum number of facilities ...