The following pages link to Epsilon nets and union complexity (Q5370694):
Displaying 15 items.
- Tighter estimates for \(\epsilon\)-nets for disks (Q265723) (← links)
- Small strong epsilon nets (Q396471) (← links)
- A non-linear lower bound for planar epsilon-nets (Q664354) (← links)
- Algorithms for covering multiple submodular constraints and applications (Q2165261) (← links)
- Near-linear algorithms for geometric hitting sets and set covers (Q2291457) (← links)
- Near-linear approximation algorithms for geometric hitting sets (Q2429345) (← links)
- A PTAS for the Weighted Unit Disk Cover Problem (Q3448847) (← links)
- A Characterization of Visibility Graphs for Pseudo-polygons (Q3452822) (← links)
- Constant-Factor Approximation for TSP with Disks (Q4604382) (← links)
- Near-Optimal Lower Bounds for ε-Nets for Half-Spaces and Low Complexity Set Systems (Q4604388) (← links)
- Tight lower bounds for the size of epsilon-nets (Q4924064) (← links)
- On Partial Covering For Geometric Set Systems (Q5115815) (← links)
- (Q5743501) (← links)
- A bicriteria approximation algorithm for the minimum hitting set problem in measurable range spaces (Q6556166) (← links)
- Hitting sets when the shallow cell complexity is small (Q6574945) (← links)
