Pages that link to "Item:Q4635551"

The following pages link to Near-Linear Algorithms for Geometric Hitting Sets and Set Covers (Q4635551):

Displaying 25 items.

• Tighter estimates for \(\epsilon\)-nets for disks (Q265723) (← links)
• Limits of local search: quality and efficiency (Q527441) (← links)
• Improved results on geometric hitting set problems (Q603882) (← links)
• Improved approximation algorithms for geometric set cover (Q866970) (← links)
• Approximability and hardness of geometric hitting set with axis-parallel rectangles (Q1621500) (← links)
• Practical and efficient algorithms for the geometric hitting set problem (Q1707909) (← links)
• \((\delta ,\varepsilon)\)-ball approximation of a shape: definition and complexity (Q1731460) (← links)
• On separating points by lines (Q1985301) (← links)
• Experiments with unit disk cover algorithms for covering massive pointsets (Q2096372) (← links)
• The maximum exposure problem (Q2123293) (← links)
• Near-linear algorithms for geometric hitting sets and set covers (Q2291457) (← links)
• Near-linear approximation algorithms for geometric hitting sets (Q2429345) (← links)
• Approximation Algorithms for Hitting Triangle-Free Sets of Line Segments (Q3188909) (← links)
• Quasi-Polynomial Time Approximation Scheme for Weighted Geometric Set Cover on Pseudodisks and Halfspaces (Q3451756) (← links)
• Geometric Hitting Sets for Disks: Theory and Practice (Q3452850) (← links)
• Finding Small Hitting Sets in Infinite Range Spaces of Bounded VC-Dimension (Q4580115) (← links)
• Shifting Coresets: Obtaining Linear-Time Approximations for Unit Disk Graphs and Other Geometric Intersection Graphs (Q4605337) (← links)
• On Geometric Set Cover for Orthants (Q5075763) (← links)
• (Q5091247) (← links)
• Improved approximation algorithms for geometric set cover (Q5370605) (← links)
• Clustering Geometrically-Modeled Points in the Aggregated Uncertainty Model (Q5862343) (← links)
• The Maximum Exposure Problem. (Q5875471) (← links)
• Computing coverage kernels under restricted settings (Q5919535) (← links)
• Improved algorithms for minimum-membership geometric set cover (Q6547827) (← links)
• PTAS for minimum cost multicovering with disks (Q6593767) (← links)