The \(\varepsilon\)-\(t\)-net problem
From MaRDI portal
Publication:2167320
DOI10.1007/s00454-022-00376-xzbMath1495.05197OpenAlexW4220913456MaRDI QIDQ2167320
Yelena Yuditsky, Chaya Keller, Noga Alon, Bruno Jartoux, Shakhar Smorodinsky
Publication date: 25 August 2022
Published in: Discrete \& Computational Geometry (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00454-022-00376-x
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- \(\varepsilon\)-Mnets: Hitting geometric set systems with subsets
- On pseudo-disk hypergraphs
- Improved approximation algorithms for geometric set cover
- Hierarchical threshold secret sharing
- Hitting sets when the VC-dimension is small
- On the union of Jordan regions and collision-free translational motion amidst polygonal obstacles
- \(\epsilon\)-nets and simplex range queries
- A bound on the chromatic number of graphs without certain induced subgraphs
- Almost tight bounds for \(\epsilon\)-nets
- Discrepancy and approximations for bounded VC-dimension
- Sharper bounds for Gaussian and empirical processes
- Applications of random sampling in computational geometry. II
- Density and dimension
- Approximations and optimal geometric divide-and-conquer
- Almost optimal set covers in finite VC-dimension
- On coloring points with respect to rectangles
- Coloring Delaunay-edges and their generalizations
- Conflict-free coloring of intersection graphs of geometric objects
- Coloring intersection hypergraphs of pseudo-disks
- Constructing planar support for non-piercing regions
- Shallow packings, semialgebraic set systems, macbeath regions, and polynomial partitioning
- A bijection between the \(d\)-dimensional simplices with distances in \(\{1,2\}\) and the partitions of \(d+1\)
- A combinatorial problem; stability and order for models and theories in infinitary languages
- On the density of families of sets
- Secret-Sharing Schemes: A Survey
- How to share a secret
- Learnability and the Vapnik-Chervonenkis dimension
- New existence proofs ε-nets
- On Linear-Time Deterministic Algorithms for Optimization Problems in Fixed Dimension
- Product Range Spaces, Sensitive Sampling, and Derandomization
- Improved Deterministic Algorithms for Linear Programming in Low Dimensions
- Approximate Polytope Membership Queries
- Tight lower bounds for the size of epsilon-nets
- On the VC-dimension of half-spaces with respect to convex sets
- A survey of χ‐boundedness
- Small-Size $\eps$-Nets for Axis-Parallel Rectangles and Boxes
- Explicit Construction of a Small $\epsilon$-Net for Linear Threshold Functions
- On the Uniform Convergence of Relative Frequencies of Events to Their Probabilities
- Geometric discrepancy. An illustrated guide
- Improved bounds on the sample complexity of learning
This page was built for publication: The \(\varepsilon\)-\(t\)-net problem
