Global ETD Search

Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.

Results

Showing 1 to 1 of 1 for “"Red-Blue Set Cover"”.

  1. Approximation Algorithms for Geometric Covering Problems for Disks and Squares

    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 problem, we are given a point set and want to cover the maximum number of points …

    waterloo Repository record for Approximation Algorithms for Geometric Covering Problems for Disks and Squares (opens in a new tab)