On a Problem of Danzer
From MaRDI portal
Publication:5222544
DOI10.1017/S0963548318000445zbMath1436.52020OpenAlexW2896317695MaRDI QIDQ5222544
Publication date: 6 April 2020
Published in: Combinatorics, Probability and Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1017/s0963548318000445
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- An optimal generalization of the colorful Carathéodory theorem
- Piercing convex sets and the Hadwiger-Debrunner \((p,q)\)-problem
- Improved bounds on the Hadwiger-Debrunner numbers
- A simple proof of optimal epsilon nets
- Applications of random sampling in computational geometry. II
- Weak \(\varepsilon \)-nets have basis of size \(O(1/\varepsilon\log (1/\varepsilon))\) in any dimension
- On Center Regions and Balls Containing Many Points
- Über Durchschnittseigenschaften n-dimensionaler Kugelfamilien.
- On Max-Clique for intersection graphs of sets and the Hadwiger-Debrunner numbers
- Near-Optimal Lower Bounds for ε-Nets for Half-Spaces and Low Complexity Set Systems