A simple proof of the shallow packing lemma

DOI10.1007/s00454-016-9767-5zbMath1385.60018OpenAlexW2292762267WikidataQ125008596 ScholiaQ125008596MaRDI QIDQ282762

Nabil H. Mustafa

Publication date: 12 May 2016

Published in: Discrete \& Computational Geometry (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00454-016-9767-5

zbMATH Keywords

VC dimensionprobabilistic methodgeometric set systemspacking lemmashallow-cell complexity

Mathematics Subject Classification ID

Combinatorial probability (60C05) Combinatorial aspects of packing and covering (05B40)

Related Items (6)

Optimal approximations made easy ⋮ Shallow packings, semialgebraic set systems, macbeath regions, and polynomial partitioning ⋮ \(\varepsilon\)-Mnets: Hitting geometric set systems with subsets ⋮ Unnamed Item ⋮ Two proofs for shallow packings ⋮ When are epsilon-nets small?

Cites Work

• Unnamed Item
• Central limit theorems for empirical measures
• Sphere packing numbers for subsets of the Boolean \(n\)-cube with bounded Vapnik-Chervonenkis dimension
• New existence proofs ε-nets
• Two Proofs for Shallow Packings
• A Size-Sensitive Discrepancy Bound for Set Systems of Bounded Primal Shatter Dimension
• Geometric discrepancy. An illustrated guide

This page was built for publication: A simple proof of the shallow packing lemma