Pages that link to "Item:Q4924064"
From MaRDI portal
The following pages link to Tight lower bounds for the size of epsilon-nets (Q4924064):
Displayed 15 items.
- \(\varepsilon\)-Mnets: Hitting geometric set systems with subsets (Q527442) (← links)
- Sparse hop spanners for unit disk graphs (Q824328) (← links)
- On the approximability of covering points by lines and related problems (Q904111) (← links)
- Geometric hitting set for segments of few orientations (Q1743112) (← links)
- Piercing axis-parallel boxes (Q1753044) (← links)
- The \(\varepsilon\)-\(t\)-net problem (Q2167320) (← links)
- Near-linear algorithms for geometric hitting sets and set covers (Q2291457) (← links)
- Subsampling in Smoothed Range Spaces (Q2835631) (← links)
- Near-Optimal Lower Bounds for ε-Nets for Half-Spaces and Low Complexity Set Systems (Q4604388) (← links)
- On the number of points in general position in the plane (Q4645041) (← links)
- An efficient container lemma (Q5144433) (← links)
- (Q5381136) (← links)
- Polychromatic colorings of unions of geometric hypergraphs (Q6039420) (← links)
- (Q6065466) (← links)
- Lower bounds for piercing and coloring boxes (Q6187716) (← links)