Epsilon nets and union complexity
From MaRDI portal
Publication:5370694
DOI10.1145/1542362.1542366zbMath1380.68407MaRDI QIDQ5370694
Publication date: 20 October 2017
Published in: Proceedings of the twenty-fifth annual symposium on Computational geometry (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/1542362.1542366
68W40: Analysis of algorithms
68U05: Computer graphics; computational geometry (digital and algorithmic aspects)
68W25: Approximation algorithms
68W20: Randomized algorithms
Related Items
Constant-Factor Approximation for TSP with Disks, Near-Optimal Lower Bounds for ε-Nets for Half-Spaces and Low Complexity Set Systems, Tight lower bounds for the size of epsilon-nets, On Partial Covering For Geometric Set Systems, Unnamed Item, Tighter estimates for \(\epsilon\)-nets for disks, Small strong epsilon nets, A non-linear lower bound for planar epsilon-nets, Algorithms for covering multiple submodular constraints and applications, Near-linear algorithms for geometric hitting sets and set covers, Near-linear approximation algorithms for geometric hitting sets, A PTAS for the Weighted Unit Disk Cover Problem, A Characterization of Visibility Graphs for Pseudo-polygons