Pages that link to "Item:Q5370605"

The following pages link to Improved approximation algorithms for geometric set cover (Q5370605):

Displaying 23 items.

• Tighter estimates for \(\epsilon\)-nets for disks (Q265723) (← links)
• Exact algorithms and APX-hardness results for geometric packing and covering problems (Q390102) (← links)
• Approximation algorithms for a geometric set cover problem (Q423912) (← links)
• Improved approximations for guarding 1.5-dimensional terrains (Q534789) (← links)
• Improved results on geometric hitting set problems (Q603882) (← links)
• Improved approximation algorithms for geometric set cover (Q866970) (← links)
• Guarding scenes against invasive hypercubes. (Q1405005) (← links)
• Near-linear time approximation schemes for geometric maximum coverage (Q1748995) (← links)
• Exact and approximation algorithms for geometric and capacitated set cover problems (Q1759660) (← links)
• Almost optimal set covers in finite VC-dimension (Q1906049) (← links)
• Parametric search: three new applications (Q2266831) (← links)
• Approximate guarding of monotone and rectilinear polygons (Q2375947) (← links)
• Polynomial-time approximation schemes for piercing and covering with applications in wireless networks (Q2477196) (← links)
• On guarding the vertices of rectilinear domains (Q2477198) (← links)
• An algorithmic framework for solving geometric covering problems -- with applications (Q2929639) (← links)
• Quasi-Polynomial Time Approximation Scheme for Weighted Geometric Set Cover on Pseudodisks and Halfspaces (Q3451756) (← links)
• Near-Linear Algorithms for Geometric Hitting Sets and Set Covers (Q4635551) (← links)
• (Q5002791) (← links)
• (Q5091247) (← links)
• Improved Local Computation Algorithm for Set Cover via Sparsification (Q5146979) (← links)
• Covering Points by Unit Disks of Fixed Location (Q5387798) (← links)
• Improved (In-)Approximability Bounds for d-Scattered Set (Q6107026) (← links)
• Geometric dominating-set and set-cover via local-search (Q6114477) (← links)