New existence proofs ε-nets
From MaRDI portal
Publication:3602913
Recommendations
Cited in
(29)- Combinatorial optimization. Abstracts from the workshop held November 7--13, 2021 (hybrid meeting)
- A PTAS for the Weighted Unit Disk Cover Problem
- A simple proof of the shallow packing lemma
- A non-linear lower bound for planar epsilon-nets
- Constructing planar support for non-piercing regions
- Near-linear algorithms for geometric hitting sets and set covers
- Improved results on geometric hitting set problems
- Geometric hitting sets for disks: theory and practice
- Subsampling in smoothed range spaces
- New Lower Bounds for ϵ-nets
- Existence of planar support for geometric hypergraphs using elementary techniques
- Practical and efficient algorithms for the geometric hitting set problem
- Planar Support for Non-piercing Regions and Applications
- Tight lower bounds for the size of epsilon-nets
- On Desarguesian extensions of elation nets
- \(\varepsilon\)-Mnets: Hitting geometric set systems with subsets
- Improved bounds on the Hadwiger-Debrunner numbers
- The within-strip discrete unit disk cover problem
- Approximation algorithms for maximum independent set of pseudo-disks
- Local search strikes again: PTAS for variants of geometric covering and packing
- Tighter estimates for \(\epsilon\)-nets for disks
- Construction of \(\epsilon\)-nets
- scientific article; zbMATH DE number 3842635 (Why is no real title available?)
- Piercing axis-parallel boxes
- Small strong epsilon nets
- Packing and covering with non-piercing regions
- Near-linear approximation algorithms for geometric hitting sets
- The \(\varepsilon\)-\(t\)-net problem
- Near-optimal lower bounds for \(\epsilon\)-nets for half-spaces and low complexity set systems
This page was built for publication: New existence proofs ε-nets
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3602913)