New existence proofs ε-nets
From MaRDI portal
Publication:3602913
DOI10.1145/1377676.1377708zbMath1221.52016OpenAlexW1975581100MaRDI QIDQ3602913
Publication date: 12 February 2009
Published in: Proceedings of the twenty-fourth annual symposium on Computational geometry (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/1377676.1377708
Combinatorial properties of polytopes and polyhedra (number of faces, shortest paths, etc.) (52B05) Hypergraphs (05C65)
Related Items (26)
Tighter estimates for \(\epsilon\)-nets for disks ⋮ A simple proof of the shallow packing lemma ⋮ A PTAS for the Weighted Unit Disk Cover Problem ⋮ Geometric Hitting Sets for Disks: Theory and Practice ⋮ Improved bounds on the Hadwiger-Debrunner numbers ⋮ The \(\varepsilon\)-\(t\)-net problem ⋮ Existence of planar support for geometric hypergraphs using elementary techniques ⋮ Improved results on geometric hitting set problems ⋮ Small strong epsilon nets ⋮ Near-linear approximation algorithms for geometric hitting sets ⋮ Near-Optimal Lower Bounds for ε-Nets for Half-Spaces and Low Complexity Set Systems ⋮ Combinatorial optimization. Abstracts from the workshop held November 7--13, 2021 (hybrid meeting) ⋮ Constructing planar support for non-piercing regions ⋮ Practical and efficient algorithms for the geometric hitting set problem ⋮ Approximation algorithms for maximum independent set of pseudo-disks ⋮ A non-linear lower bound for planar epsilon-nets ⋮ Planar Support for Non-piercing Regions and Applications ⋮ Packing and covering with non-piercing regions ⋮ Piercing axis-parallel boxes ⋮ \(\varepsilon\)-Mnets: Hitting geometric set systems with subsets ⋮ The within-strip discrete unit disk cover problem ⋮ Tight lower bounds for the size of epsilon-nets ⋮ Approximation algorithms for the connected sensor cover problem ⋮ Near-linear algorithms for geometric hitting sets and set covers ⋮ Local search strikes again: PTAS for variants of geometric covering and packing ⋮ Subsampling in Smoothed Range Spaces
This page was built for publication: New existence proofs ε-nets
