<?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-22T19:51:12Z</responseDate><request verb="GetRecord" identifier="oai:uwspace.uwaterloo.ca:10012/1025" metadataPrefix="dim">https://dspacemainprd01.lib.uwaterloo.ca/server/oai/request</request><GetRecord><record><header><identifier>oai:uwspace.uwaterloo.ca:10012/1025</identifier><datestamp>2017-03-21T14:22:52Z</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" lang="en" authority="e4aae3dd-616c-46dc-8e06-874d579247fa" confidence="600">Mahmood, Abdullah-Al</dim:field>
   <dim:field mdschema="dc" element="date" qualifier="accessioned">2006-08-22T14:27:39Z</dim:field>
   <dim:field mdschema="dc" element="date" qualifier="available">2006-08-22T14:27:39Z</dim:field>
   <dim:field mdschema="dc" element="date" qualifier="issued" lang="en">2005</dim:field>
   <dim:field mdschema="dc" element="date" qualifier="submitted" lang="en">2005</dim:field>
   <dim:field mdschema="dc" element="identifier" qualifier="uri">http://hdl.handle.net/10012/1025</dim:field>
   <dim:field mdschema="dc" element="description" qualifier="abstract" lang="en">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 for a set of given rectangular demand regions such that each region has at least one facility located within it.   It has been shown that even if all regions are uniform sized squares, the  problem is NP-hard.   Therefore we concentrate on approximation algorithms for the problem.   As the known approximation ratio for arbitrarily sized rectangles is poor, we restrict our effort to  designing approximation algorithms for  unit-height rectangles.   Our  e-approximation scheme requires  &amp;lt;I&amp;gt;n&amp;lt;/I&amp;gt;&amp;lt;sup&amp;gt;&amp;lt;I&amp;gt;O&amp;lt;/I&amp;gt;(1/&amp;amp;epsilon;²)&amp;lt;/sup&amp;gt;  time.    We also consider the problem with restrictions like bounding the depth of a point and the width of the rectangles.   The approximation schemes for these two cases take &amp;lt;I&amp;gt;n&amp;lt;/I&amp;gt;&amp;lt;sup&amp;gt;&amp;lt;I&amp;gt;O&amp;lt;/I&amp;gt;(1/&amp;amp;epsilon;)&amp;lt;/sup&amp;gt;  time.   We also show how to maintain a factor 2 approximation of the piercing set in  &amp;lt;I&amp;gt;O&amp;lt;/I&amp;gt;(log &amp;lt;I&amp;gt;n&amp;lt;/I&amp;gt;) amortized time in an insertion-only scenario.</dim:field>
   <dim:field mdschema="dc" element="format" lang="en">application/pdf</dim:field>
   <dim:field mdschema="dc" element="format" qualifier="extent">384412 bytes</dim:field>
   <dim:field mdschema="dc" element="format" qualifier="mimetype">application/pdf</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="rights" lang="en">Copyright: 2005, 
  Mahmood, Abdullah-Al. All rights reserved.</dim:field>
   <dim:field mdschema="dc" element="subject" lang="en">Computer Science</dim:field>
   <dim:field mdschema="dc" element="subject" lang="en">piercing</dim:field>
   <dim:field mdschema="dc" element="subject" lang="en">stabbing</dim:field>
   <dim:field mdschema="dc" element="subject" lang="en">algorithm</dim:field>
   <dim:field mdschema="dc" element="subject" lang="en">approximation algorithm</dim:field>
   <dim:field mdschema="dc" element="subject" lang="en">approximation scheme</dim:field>
   <dim:field mdschema="dc" element="subject" lang="en">PTAS</dim:field>
   <dim:field mdschema="dc" element="subject" lang="en">shifting</dim:field>
   <dim:field mdschema="dc" element="subject" lang="en">rectangle</dim:field>
   <dim:field mdschema="dc" element="subject" lang="en">interval piercing</dim:field>
   <dim:field mdschema="dc" element="title" lang="en">Approximation Algorithms for Rectangle Piercing Problems</dim:field>
   <dim:field mdschema="dc" element="type" lang="en">Master Thesis</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>