ε\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\varepsilon $$\end{document}-Mnets: Hitting Geometric Set Systems wit

No abstract is available for this paper.

• Publication year

  2016

• Venue

  Discrete & Computational Geometry

• Publication date

  2016-12-08

• Fields of study

  Mathematics, Computer Science

• Identifiers
  DOI 10.1007/s00454-016-9845-8
• External record

  Open on Semantic Scholar

• Source metadata

  Semantic Scholar

• No claims are published for this paper.

• No concepts are published for this paper.

• New Lower Bounds for epsilon-Nets

  2016cited by this paper
• A Simple Proof of the Shallow Packing Lemma

  2016cited by this paper
• Near-Optimal Generalisations of a Theorem of Macbeath

  2014cited by this paper
• Small-Size $\eps$-Nets for Axis-Parallel Rectangles and Boxes

  2010cited by this paper
• A Unified Approach to Approximate Proximity Searching

  2010cited by this paper
• Tight lower bounds for the size of epsilon-nets

  2010cited by this paper
• Small-size ε-nets for axis-parallel rectangles and boxes

  2009cited by this paper
• On the set multi-cover problem in geometric settings

  2009cited by this paper
• Geometric Discrepancy: An Illustrated Guide

  2009cited by this paper
• New existence proofs ε-nets

  2008cited by this paper
• State of the Union ( of Geometric Objects ) : A Review ∗

  2007influential reference
• Random polytopes, convex bodies, and approximation

  2007cited by this paper
• Combinatorial Geometry

  2006cited by this paper
• Lectures on discrete geometry

  2002influential reference
• The Discrepancy Method: Randomness and Complexity

  2000cited by this paper
• Combinatorial geometry

  1995cited by this paper
• How hard is half-space range searching?

  1993cited by this paper
• Reporting Points in Halfspaces

  1992cited by this paper
• Almost tight bounds forɛ-Nets

  1992cited by this paper
• Almost tight bounds for $\epsilon$-nets

  1992cited by this paper
• Efficient partition trees

  1991cited by this paper
• CONVEX-BODIES, ECONOMIC CAP COVERINGS, RANDOM POLYTOPES

  1988cited by this paper
• ɛ-nets and simplex range queries

  1987cited by this paper
• Epsilon-nets and simplex range queries

  1986influential reference
• The directions of the line segments and of the r -dimensional balls on the boundary of a convex body in Euclidean space

  1970cited by this paper
• A THEOREM ON NON-HOMOGENEOUS LATTICES'

  1952influential reference

• Stabbing boxes with finitely many axis-parallel lines and flats

  2023cites this paper
• Uniform Brackets, Containers, and Combinatorial Macbeath Regions

  2021cites this paper
• The ε-t-Net Problem

  2020cites this paper
• The ε\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\varepsilon $$\end{document}-t-Net Problem

  2020cites this paper
• Shallow Packings, Semialgebraic Set Systems, Macbeath Regions, and Polynomial Partitioning

  2019cites this paper
• On combinatorial approximation algorithms in geometry

  2018influential citation
• Coloring Delaunay-Edges and their Generalizations

  2018cites this paper
• Tverberg theorems over discrete sets of points

  2018cites this paper
• Shallow Packings, Semialgebraic Set Systems, Macbeath Regions, and Polynomial Partitioning

  2017cites this paper
• 47 EPSILON-APPROXIMATIONS & EPSILON-NETS

  2016cites this paper