The following pages link to New Lower Bounds for ϵ-nets (Q3132890):
Displaying 13 items.
- \(\varepsilon\)-Mnets: Hitting geometric set systems with subsets (Q527442) (← links)
- A lower bound for weak \(\varepsilon\)-nets in high dimension (Q1611071) (← links)
- A simple proof of optimal epsilon nets (Q1715082) (← links)
- The \(\varepsilon\)-\(t\)-net problem (Q2167320) (← links)
- Near-linear algorithms for geometric hitting sets and set covers (Q2291457) (← links)
- When are epsilon-nets small? (Q2304628) (← links)
- Weak \(\varepsilon \)-nets have basis of size \(O(1/\varepsilon\log (1/\varepsilon))\) in any dimension (Q2479477) (← links)
- Near-optimal generalisations of a theorem of Macbeath (Q2965518) (← links)
- (Q5088989) (← links)
- The discrete yet ubiquitous theorems of Carathéodory, Helly, Sperner, Tucker, and Tverberg (Q5241224) (← links)
- (Q5381136) (← links)
- Stronger bounds for weak epsilon-nets in higher dimensions (Q6065226) (← links)
- Stabbing boxes with finitely many axis-parallel lines and flats (Q6646396) (← links)
