Back to search

University of Waterloo

Approximation Algorithms for Rectangle Piercing Problems

Abstract

dc:description.abstract

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 <I>n</I><sup><I>O</I>(1/&epsilon;²)</sup> 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 <I>n</I><sup><I>O</I>(1/&epsilon;)</sup> time. We also show how to maintain a factor 2 approximation of the piercing set in <I>O</I>(log <I>n</I>) amortized time in an insertion-only scenario.

Degree

thesis:*
Grantor dc:publisher
University of Waterloo
Year dc:date.issued
2005

Author and committee

dc:creator, dc:contributor.*
Author dc:creator
  • Mahmood, Abdullah-Al

Subjects

dc:subject × 10

Rights

dc:rights
Statement dc:rights
  • Copyright: 2005, Mahmood, Abdullah-Al. All rights reserved.
Language dc:language.iso
en

Identifiers

dc:identifier.*
Handle dc:identifier.uri
http://hdl.handle.net/10012/1025

Chain of custody

source
Harvested from
University of Waterloo
Base URL
dspacemainprd01.lib.uwaterloo.ca/server/oai/request
Last updated
2026-11-19
Source record
OAI-PMH GetRecord
citation

Mahmood, Abdullah-Al. Approximation Algorithms for Rectangle Piercing Problems. University of Waterloo, 2005. http://hdl.handle.net/10012/1025