Pages that link to "Item:Q1184160"

The following pages link to Almost tight bounds for \(\epsilon\)-nets (Q1184160):

Displaying 50 items.

• Tighter estimates for \(\epsilon\)-nets for disks (Q265723) (← links)
• A new upper bound for the VC-dimension of visibility regions (Q390367) (← links)
• Small strong epsilon nets (Q396471) (← links)
• Domination in transitive colorings of tournaments (Q403357) (← links)
• A note about weak \(\epsilon \)-nets for axis-parallel boxes in \(d\)-space (Q407569) (← links)
• Piercing quasi-rectangles-on a problem of Danzer and Rogers (Q439049) (← links)
• \(\varepsilon\)-Mnets: Hitting geometric set systems with subsets (Q527442) (← links)
• Relative \((p,\varepsilon )\)-approximations in geometry (Q633202) (← links)
• Improved approximation for guarding simple galleries from the perimeter (Q635755) (← links)
• Polychromatic coloring for half-planes (Q645968) (← links)
• A non-linear lower bound for planar epsilon-nets (Q664354) (← links)
• An optimal generalization of the colorful Carathéodory theorem (Q906475) (← links)
• Random constructions and density results (Q1009013) (← links)
• Small weak epsilon-nets (Q1025302) (← links)
• Hitting sets when the VC-dimension is small (Q1041786) (← links)
• Guarding galleries where no point sees a small area. (Q1279960) (← links)
• Bounding the vertex cover number of a hypergraph (Q1323476) (← links)
• On range searching with semialgebraic sets (Q1329188) (← links)
• Vapnik-Chervonenkis dimension and (pseudo-)hyperplane arrangements (Q1338464) (← links)
• Practical and efficient algorithms for the geometric hitting set problem (Q1707909) (← links)
• Approximating a convex body by a polytope using the epsilon-net theorem (Q1731464) (← links)
• Transversal numbers for hypergraphs arising in geometry (Q1865252) (← links)
• Almost optimal set covers in finite VC-dimension (Q1906049) (← links)
• Quasi-Monte-Carlo methods and the dispersion of point sequences (Q1921094) (← links)
• Optimal approximations made easy (Q2122796) (← links)
• On the geometric set multicover problem (Q2167317) (← links)
• The \(\varepsilon\)-\(t\)-net problem (Q2167320) (← links)
• Decomposing arrangements of hyperplanes: VC-dimension, combinatorial dimension, and point location (Q2189742) (← links)
• System of unbiased representatives for a collection of bicolorings (Q2201776) (← links)
• An application of the universality theorem for Tverberg partitions to data depth and hitting convex sets (Q2206734) (← links)
• A Sauer-Shelah-Perles lemma for lattices (Q2209889) (← links)
• Random polytopes and the wet part for arbitrary probability distributions (Q2211500) (← links)
• When are epsilon-nets small? (Q2304628) (← links)
• An \(O(\lg \lg {\mathrm {OPT}})\)-approximation algorithm for multi-guarding galleries (Q2340409) (← links)
• Erdős-Hajnal conjecture for graphs with bounded VC-dimension (Q2415381) (← links)
• Quasi-Polynomial Time Approximation Scheme for Weighted Geometric Set Cover on Pseudodisks and Halfspaces (Q3451756) (← links)
• Near-Optimal Lower Bounds for ε-Nets for Half-Spaces and Low Complexity Set Systems (Q4604388) (← links)
• Sign rank versus Vapnik-Chervonenkis dimension (Q4610199) (← links)
• Approximating Nonnegative Polynomials via Spectral Sparsification (Q4629345) (← links)
• On the number of points in general position in the plane (Q4645041) (← links)
• Tight lower bounds for the size of epsilon-nets (Q4924064) (← links)
• Quantitative structure of stable sets in arbitrary finite groups (Q5002564) (← links)
• Minimum entangling power is close to its maximum (Q5053518) (← links)
• Arrangements in higher dimensions: Voronoi diagrams, motion planning, and other applications (Q5057426) (← links)
• (Q5088989) (← links)
• (Q5091247) (← links)
• An efficient container lemma (Q5144433) (← links)
• Pseudofinite groups and VC-dimension (Q5156474) (← links)
• Improved Approximation Algorithm for Set Multicover with Non-Piercing Regions. (Q5874550) (← links)
• Combinatorial optimization algorithms for radio network planning (Q5941516) (← links)