New Lower Bounds for ϵ-nets
From MaRDI portal
Publication:3132890
Recommendations
- Almost tight bounds for -nets
- Tight lower bounds for the size of epsilon-nets
- Tight lower bounds for the size of epsilon-nets
- Near-optimal lower bounds for \(\epsilon\)-nets for half-spaces and low complexity set systems
- New existence proofs ε-nets
- New constructions of weak -nets
- Improved bounds on weak \(\varepsilon\)-nets for convex sets
- A lower bound for weak \(\varepsilon\)-nets in high dimension
Cited in
(18)- When are epsilon-nets small?
- New existence proofs ε-nets
- Stabbing boxes with finitely many axis-parallel lines and flats
- Near-linear algorithms for geometric hitting sets and set covers
- A simple proof of optimal epsilon nets
- Near-optimal generalisations of a theorem of Macbeath
- Stronger bounds for weak epsilon-nets in higher dimensions
- Tight lower bounds on the VC-dimension of geometric set systems
- Weak \(\varepsilon \)-nets have basis of size \(O(1/\varepsilon\log (1/\varepsilon))\) in any dimension
- scientific article; zbMATH DE number 7559257 (Why is no real title available?)
- Tight lower bounds for the size of epsilon-nets
- \(\varepsilon\)-Mnets: Hitting geometric set systems with subsets
- Explicit construction of a small \(\epsilon\)-net for linear threshold functions
- Tight lower bounds for the size of epsilon-nets
- A lower bound for weak \(\varepsilon\)-nets in high dimension
- 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
This page was built for publication: New Lower Bounds for ϵ-nets
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3132890)
