Pages that link to "Item:Q3588405"

The following pages link to PTAS for Weighted Set Cover on Unit Squares (Q3588405):

Displaying 20 items.

• Exact algorithms and APX-hardness results for geometric packing and covering problems (Q390102) (← links)
• The within-strip discrete unit disk cover problem (Q528480) (← links)
• On the stab number of rectangle intersection graphs (Q778517) (← links)
• A polynomial-time approximation scheme for the geometric unique coverage problem on unit squares (Q902421) (← links)
• \(\mathsf{NP}\)-hardness of geometric set cover and hitting set with rectangles containing a common point (Q1621499) (← links)
• Approximability and hardness of geometric hitting set with axis-parallel rectangles (Q1621500) (← links)
• Weighted geometric set cover with rectangles of bounded integer side lengths (Q2133398) (← links)
• On the geometric set multicover problem (Q2167317) (← links)
• On the geometric red-blue set cover problem (Q2232240) (← links)
• On interval and circular-arc covering problems (Q2327673) (← links)
• Geometric red-blue set cover for unit squares and related problems (Q2341691) (← links)
• A PTAS for the Weighted Unit Disk Cover Problem (Q3448847) (← links)
• Covering, Hitting, Piercing and Packing Rectangles Intersecting an Inclined Line (Q3467840) (← links)
• Discrete unit square cover problem (Q4644781) (← links)
• On Geometric Set Cover for Orthants (Q5075763) (← links)
• On Partial Covering For Geometric Set Systems (Q5115815) (← links)
• On Covering Segments with Unit Intervals (Q5864214) (← links)
• A constant-factor approximation algorithm for red-blue set cover with unit disks (Q5918633) (← links)
• Geometric dominating-set and set-cover via local-search (Q6114477) (← links)
• Approximation algorithms for minimum ply covering of points with unit squares and unit disks (Q6652449) (← links)