Now showing items 1-3 of 3

    • Approximation Algorithms for Geometric Covering Problems for Disks and Squares 

      Hu, Nan (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 

      Mahmood, Abdullah-Al (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 ...
    • Hardness results and approximation algorithms for some problems on graphs 

      Aazami, Ashkan (University of Waterloo, 2008-12-17)
      This thesis has two parts. In the first part, we study some graph covering problems with a non-local covering rule that allows a "remote" node to be covered by repeatedly applying the covering rule. In the second part, we ...


      University of Waterloo Library
      200 University Avenue West
      Waterloo, Ontario, Canada N2L 3G1
      519 888 4883

      All items in UWSpace are protected by copyright, with all rights reserved.

      DSpace software

      Service outages