On a problem of Danzer
From MaRDI portal
Publication:5222544
Recommendations
Cites work
- scientific article; zbMATH DE number 3843786 (Why is no real title available?)
- scientific article; zbMATH DE number 177380 (Why is no real title available?)
- scientific article; zbMATH DE number 1749054 (Why is no real title available?)
- scientific article; zbMATH DE number 2209723 (Why is no real title available?)
- A simple proof of optimal epsilon nets
- An optimal generalization of the colorful Carathéodory theorem
- Applications of random sampling in computational geometry. II
- Improved bounds on the Hadwiger-Debrunner numbers
- Near-optimal lower bounds for \(\epsilon\)-nets for half-spaces and low complexity set systems
- On Center Regions and Balls Containing Many Points
- On max-clique for intersection graphs of sets and the Hadwiger-Debrunner numbers
- Piercing convex sets and the Hadwiger-Debrunner \((p,q)\)-problem
- Weak \(\varepsilon \)-nets have basis of size \(O(1/\varepsilon\log (1/\varepsilon))\) in any dimension
- \(k\)-sets and \(k\)-facets
- Über Durchschnittseigenschaften n-dimensionaler Kugelfamilien.
Cited in
(2)
This page was built for publication: On a problem of Danzer
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5222544)