The -t-net problem
From MaRDI portal
Publication:2167320
Recommendations
Cites work
- -nets and simplex range queries
- \(\varepsilon\)-Mnets: Hitting geometric set systems with subsets
- A bijection between the \(d\)-dimensional simplices with distances in \(\{1,2\}\) and the partitions of \(d+1\)
- A bound on the chromatic number of graphs without certain induced subgraphs
- A combinatorial problem; stability and order for models and theories in infinitary languages
- A survey of -boundedness
- Almost optimal set covers in finite VC-dimension
- Almost tight bounds for -nets
- Applications of random sampling in computational geometry. II
- Approximate polytope membership queries
- Approximations and optimal geometric divide-and-conquer
- Coloring Delaunay-edges and their generalizations
- Coloring intersection hypergraphs of pseudo-disks
- Constructing planar support for non-piercing regions
- Density and dimension
- Discrepancy and approximations for bounded VC-dimension
- Explicit construction of a small -net for linear threshold functions
- Geometric discrepancy. An illustrated guide
- Hierarchical threshold secret sharing
- Hitting sets when the VC-dimension is small
- How to share a secret
- scientific article; zbMATH DE number 5942358 (Why is no real title available?)
- scientific article; zbMATH DE number 1749054 (Why is no real title available?)
- scientific article; zbMATH DE number 3299758 (Why is no real title available?)
- Improved approximation algorithms for geometric set cover
- Improved bounds on the sample complexity of learning
- Improved deterministic algorithms for linear programming in low dimensions
- Learnability and the Vapnik-Chervonenkis dimension
- New existence proofs ε-nets
- On coloring points with respect to rectangles
- On Linear-Time Deterministic Algorithms for Optimization Problems in Fixed Dimension
- On pseudo-disk hypergraphs
- On the density of families of sets
- On the Uniform Convergence of Relative Frequencies of Events to Their Probabilities
- On the union of Jordan regions and collision-free translational motion amidst polygonal obstacles
- On the VC-dimension of half-spaces with respect to convex sets
- Product Range Spaces, Sensitive Sampling, and Derandomization
- Secret-Sharing Schemes: A Survey
- Shallow packings, semialgebraic set systems, macbeath regions, and polynomial partitioning
- Sharper bounds for Gaussian and empirical processes
- Small-size -nets for axis-parallel rectangles and boxes
- State of the union (of geometric objects)
- Tight lower bounds for the size of epsilon-nets
Cited in
(7)- New existence proofs ε-nets
- Computing optimal \(\varepsilon\)-nets is as easy as finding an unhit set
- Explicit construction of a small epsilon-net for linear threshold functions
- Explicit construction of a small -net for linear threshold functions
- Zarankiewicz's problem via -t-nets
- A survey of degree-boundedness
- Polychromatic coloring of tuples in hypergraphs
This page was built for publication: The \(\varepsilon\)-\(t\)-net problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2167320)
