On weak \(\epsilon\)-nets and the Radon number
From MaRDI portal
Publication:2223615
DOI10.1007/s00454-020-00222-yzbMath1472.52002arXiv1707.05381OpenAlexW2962766019MaRDI QIDQ2223615
Publication date: 29 January 2021
Published in: Discrete \& Computational Geometry (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1707.05381
Axiomatic and generalized convexity (52A01) Helly-type theorems and geometric transversal theory (52A35)
Related Items
Radon numbers grow linearly, First-order logic axiomatization of metric graph theory, Radon numbers and the fractional Helly theorem, Helly-type problems
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A note about weak \(\epsilon \)-nets for axis-parallel boxes in \(d\)-space
- Lower bounds for weak epsilon-nets and stair-convexity
- A non-linear lower bound for planar epsilon-nets
- Kneser's conjecture, chromatic number, and homotopy
- Über eine Variante zum Hellyschen Satz
- \(\epsilon\)-nets and simplex range queries
- Some special Vapnik-Chervonenkis classes
- Piercing convex sets and the Hadwiger-Debrunner \((p,q)\)-problem
- Separation of two convex sets in convexity structures
- Sphere packing numbers for subsets of the Boolean \(n\)-cube with bounded Vapnik-Chervonenkis dimension
- Improved bounds on weak \(\varepsilon\)-nets for convex sets
- A lower bound for weak \(\varepsilon\)-nets in high dimension
- Transversal numbers for hypergraphs arising in geometry
- Axiomatic convexity theory and relationships between the Carathéodory, Helly, and Radon numbers
- On the number of halving planes
- Maximal convex sets
- The structure of semispaces
- On Components in Some Families of Sets
- Learnability and the Vapnik-Chervonenkis dimension
- On the Geometry and Computational Complexity of Radon Partitions in the Iinteger Lattice
- Point Selections and Weak ε-Nets for Convex Hulls
- Understanding Machine Learning
- Families of Non-disjoint subsets
