A simple proof of optimal epsilon nets
From MaRDI portal
Recommendations
- Shallow packings, semialgebraic set systems, macbeath regions, and polynomial partitioning
- New Lower Bounds for ϵ-nets
- Near-optimal lower bounds for \(\epsilon\)-nets for half-spaces and low complexity set systems
- Shallow packings, semialgebraic set systems, Macbeath regions, and polynomial partitioning
- Two proofs for shallow packings
- Two proofs for shallow packings
- Computing optimal \(\varepsilon\)-nets is as easy as finding an unhit set
- On the size of set systems on \([n]\) not containing weak \((r,\Delta)\)-systems
- On Extremal Set Partitions in Cartesian Product Spaces
- scientific article; zbMATH DE number 1195522
Cited in
(17)- When are epsilon-nets small?
- New existence proofs ε-nets
- Stabbing boxes with finitely many axis-parallel lines and flats
- Shallow packings, semialgebraic set systems, macbeath regions, and polynomial partitioning
- Deterministic Fault-Tolerant Connectivity Labeling Scheme
- scientific article; zbMATH DE number 7561580 (Why is no real title available?)
- Hitting sets when the shallow cell complexity is small
- Two proofs for shallow packings
- Two proofs for shallow packings
- Using \(\epsilon\)-nets for solving the classification problem
- Tight lower bounds for the size of epsilon-nets
- Shallow packings, semialgebraic set systems, Macbeath regions, and polynomial partitioning
- Epsilon nets and union complexity
- The \(\varepsilon\)-\(t\)-net problem
- The discrete yet ubiquitous theorems of Carathéodory, Helly, Sperner, Tucker, and Tverberg
- Near-optimal lower bounds for \(\epsilon\)-nets for half-spaces and low complexity set systems
- On a problem of Danzer
This page was built for publication: A simple proof of optimal epsilon nets
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1715082)
