Some new bounds for Epsilon-nets
SCG '90 Proceedings of the sixth annual symposium on Computational geometry
How to net a lot with little: small &egr;-nets for disks and halfspaces
SCG '90 Proceedings of the sixth annual symposium on Computational geometry
Planar orientations with low out-degree and compaction of adjacency matrices
Theoretical Computer Science
Computational learning theory: an introduction
Computational learning theory: an introduction
Almost tight bounds for &egr;-nets
Discrete & Computational Geometry
Reporting points in halfspaces
Computational Geometry: Theory and Applications
Randomized algorithms
Computational geometry: algorithms and applications
Computational geometry: algorithms and applications
Pseudo-line arrangements: duality, algorithms, and applications
SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
Lectures on Discrete Geometry
Lenses in arrangements of pseudo-circles and their applications
Journal of the ACM (JACM)
On the chromatic number of some geometric hypergraphs
SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm
Improved Approximation Algorithms for Geometric Set Cover
Discrete & Computational Geometry
Small-size ε-nets for axis-parallel rectangles and boxes
Proceedings of the forty-first annual ACM symposium on Theory of computing
Epsilon nets and union complexity
Proceedings of the twenty-fifth annual symposium on Computational geometry
PTAS for geometric hitting set problems via local search
Proceedings of the twenty-fifth annual symposium on Computational geometry
Near-linear approximation algorithms for geometric hitting sets
Proceedings of the twenty-fifth annual symposium on Computational geometry
Approximation algorithms for maximum independent set of pseudo-disks
Proceedings of the twenty-fifth annual symposium on Computational geometry
Small Approximate Pareto Sets for Biobjective Shortest Paths and Other Problems
SIAM Journal on Computing
Small-Size $\eps$-Nets for Axis-Parallel Rectangles and Boxes
SIAM Journal on Computing
Tight lower bounds for the size of epsilon-nets
Proceedings of the twenty-seventh annual symposium on Computational geometry
SIAM Journal on Computing
Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete Algorithms
Small-size relative (p,ε)-approximations for well-behaved range spaces
Proceedings of the twenty-ninth annual symposium on Computational geometry
| Hi-index | 0.00 |
We describe a new technique for proving the existence of small μ-nets for hypergraphs satisfying certain simple conditions. The technique is particularly useful for proving o(1/μ log 1/μ) upper bounds which the standard VC-dimension theory does not allow. We apply the technique to several geometric hypergraphs and obtain simple proofs for the existence of O(1/μ) size μ-nets for them. This includes the geometric hypergraph in which the vertex set is a set of points in the plane and the hyperedges are defined by a set of pseudo-disks. This result was not known previously. We also get a very short proof for O(1/μ) size μ-nets for half-spaces in R3.