Pages that link to "Item:Q2968086"

The following pages link to WEIGHTED GEOMETRIC SET COVER PROBLEMS REVISITED (Q2968086):

Displaying 20 items.

• Exact algorithms and APX-hardness results for geometric packing and covering problems (Q390102) (← links)
• Weighted geometric set cover with rectangles of bounded integer side lengths (Q2133398) (← links)
• Capacitated covering problems in geometric spaces (Q2189730) (← links)
• Finding, hitting and packing cycles in subexponential time on unit disk graphs (Q2334507) (← links)
• A PTAS for the cardinality constrained covering with unit balls (Q2437774) (← links)
• Weighted geometric set cover via quasi-uniform sampling (Q2875191) (← links)
• Weighted geometric set multi-cover via quasi-uniform sampling (Q2970451) (← links)
• Multi Cover of a Polygon Minimizing the Sum of Areas (Q3078391) (← links)
• A PTAS for the Weighted Unit Disk Cover Problem (Q3448847) (← links)
• Quasi-Polynomial Time Approximation Scheme for Weighted Geometric Set Cover on Pseudodisks and Halfspaces (Q3451756) (← links)
• (Q4595724) (← links)
• Capacitated Covering Problems in Geometric Spaces (Q5115774) (← links)
• (Q5874473) (← links)
• Algorithms for the line-constrained disk coverage and related problems (Q5896893) (← links)
• Algorithms for the line-constrained disk coverage and related problems (Q5918695) (← links)
• On the geometric priority set cover problem (Q6103173) (← links)
• Improved bounds for metric capacitated covering problems (Q6107884) (← links)
• Geometric dominating-set and set-cover via local-search (Q6114477) (← links)
• PTAS for minimum cost multicovering with disks (Q6593767) (← links)
• On the line-separable unit-disk coverage and related problems (Q6600812) (← links)