<?xml version="1.0" encoding="UTF-8"?><?xml-stylesheet type="text/xsl" href="static/style.xsl"?><OAI-PMH xmlns="http://www.openarchives.org/OAI/2.0/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/ http://www.openarchives.org/OAI/2.0/OAI-PMH.xsd"><responseDate>2026-11-22T14:06:43Z</responseDate><request verb="GetRecord" identifier="oai:uwspace.uwaterloo.ca:10012/7703" metadataPrefix="dim">https://dspacemainprd01.lib.uwaterloo.ca/server/oai/request</request><GetRecord><record><header><identifier>oai:uwspace.uwaterloo.ca:10012/7703</identifier><datestamp>2017-03-21T20:30:23Z</datestamp><setSpec>com_10012_9924</setSpec><setSpec>com_10012_1</setSpec><setSpec>col_10012_9930</setSpec><setSpec>col_10012_6</setSpec></header><metadata><dim:dim xmlns:dim="http://www.dspace.org/xmlns/dspace/dim" xmlns:doc="http://www.lyncode.com/xoai" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://www.dspace.org/xmlns/dspace/dim http://www.dspace.org/schema/dim.xsd">
   <dim:field mdschema="dc" element="contributor" qualifier="author" authority="15b801ed-468f-475b-b3f6-2dd0dbd2d87c" confidence="600">Hu, Nan</dim:field>
   <dim:field mdschema="dc" element="date" qualifier="accessioned">2013-08-15T15:52:27Z</dim:field>
   <dim:field mdschema="dc" element="date" qualifier="available">2013-08-15T15:52:27Z</dim:field>
   <dim:field mdschema="dc" element="date" qualifier="issued">2013-08-15T15:52:27Z</dim:field>
   <dim:field mdschema="dc" element="date" qualifier="submitted">2013</dim:field>
   <dim:field mdschema="dc" element="identifier" qualifier="uri">http://hdl.handle.net/10012/7703</dim:field>
   <dim:field mdschema="dc" element="description" qualifier="abstract" lang="en">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.&#xd;
&#xd;
In the Disjoint Unit-Disk Cover problem, we are given a point set and want to cover the maximum number of points using disjoint unit disks. We prove that the problem is NP-complete and give a polynomial-time approximation scheme (PTAS) for it.&#xd;
&#xd;
In Depth-(≤ K) Packing for Arbitrary-Size Disks/Squares, we are given a set of arbitrary-size disks/squares, and want to find a subset with depth at most K and maximizing the total area. We prove a depth reduction theorem and present a PTAS.&#xd;
&#xd;
In Red-Blue Unit-Square Cover, we are given a red point set, a blue point set and a&#xd;
set of unit squares, and want to find a subset of unit squares to cover all the blue points and the minimum number of red points. We prove that the problem is NP-hard, and give a PTAS for it. A &amp;quot;mod-one&amp;quot; trick we introduce can be applied to several other covering problems on unit squares.</dim:field>
   <dim:field mdschema="dc" element="language" qualifier="iso" lang="en">en</dim:field>
   <dim:field mdschema="dc" element="publisher" lang="en">University of Waterloo</dim:field>
   <dim:field mdschema="dc" element="subject" lang="en">computational geometry</dim:field>
   <dim:field mdschema="dc" element="subject" lang="en">approximation algorithm</dim:field>
   <dim:field mdschema="dc" element="subject" lang="en">PTAS</dim:field>
   <dim:field mdschema="dc" element="subject" lang="en">Red-Blue Set Cover</dim:field>
   <dim:field mdschema="dc" element="subject" lang="en">Depth-(&amp;lt;K) Packing</dim:field>
   <dim:field mdschema="dc" element="subject" lang="en">Disjoint Unit-Disk Cover</dim:field>
   <dim:field mdschema="dc" element="subject" qualifier="program" lang="en">Computer Science</dim:field>
   <dim:field mdschema="dc" element="title" lang="en">Approximation Algorithms for Geometric Covering Problems for Disks and Squares</dim:field>
   <dim:field mdschema="dc" element="type" lang="en">Master Thesis</dim:field>
   <dim:field mdschema="dc" element="comment" qualifier="hidden" lang="en">One of my chapter contains the work with professor Timothy M. Chan, who is also my supervisor. Our work is published in CCCG2013, paper title: Geometric Red-Blue Set Cover for Unit Squares and Related Problems. Timothy Chan agrees to put the work in my thesis, and do not require a written permission.</dim:field>
   <dim:field mdschema="dc" element="pending" lang="en">false</dim:field>
   <dim:field mdschema="uws-etd" element="degree" qualifier="department" lang="en">School of Computer Science</dim:field>
   <dim:field mdschema="uws-etd" element="degree" lang="en">Master of Mathematics</dim:field>
   <dim:field mdschema="uws" element="typeOfResource" lang="en">Text</dim:field>
   <dim:field mdschema="uws" element="peerReviewStatus" lang="en">Unreviewed</dim:field>
   <dim:field mdschema="uws" element="scholarLevel" lang="en">Graduate</dim:field>
   <dim:field mdschema="others" element="access-status">open.access</dim:field>
</dim:dim>
</metadata></record></GetRecord></OAI-PMH>