Tight lower bounds for the size of epsilon-nets
From MaRDI portal
Publication:5404461
DOI10.1145/1998196.1998271zbMath1283.68375MaRDI QIDQ5404461
Publication date: 24 March 2014
Published in: Proceedings of the twenty-seventh annual symposium on Computational geometry (Search for Journal in Brave)
Full work available at URL: http://real.mtak.hu/10036/1/1012.1240.pdf
68U05: Computer graphics; computational geometry (digital and algorithmic aspects)
05D15: Transversal (matching) theory
52C10: Erd?s problems and related topics of discrete geometry
Related Items
Tight lower bounds for the size of epsilon-nets, Unnamed Item, On Geometric Set Cover for Orthants, On the geometric priority set cover problem, Exact algorithms and APX-hardness results for geometric packing and covering problems, Small strong epsilon nets, Hardness of discrepancy computation and \(\varepsilon\)-net verification in high dimension, The class cover problem with boxes, Piercing quasi-rectangles-on a problem of Danzer and Rogers, Weighted geometric set cover with rectangles of bounded integer side lengths, Near-linear approximation algorithms for geometric hitting sets