Helly-type theorems for approximate covering
From MaRDI portal
Publication:5896959
DOI10.1007/s00454-009-9167-1zbMath1178.52004OpenAlexW4232855115MaRDI QIDQ5896959
Olivier Devillers, Marc Glisse, Julien Demouth, Xavier Goaoc
Publication date: 27 August 2009
Published in: Discrete \& Computational Geometry (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00454-009-9167-1
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Improved approximation algorithms for geometric set cover
- Helly-type theorems and generalized linear programming
- Almost optimal set covers in finite VC-dimension
- How many maxima can there be?
- A threshold of ln n for approximating set cover
- Helly's Theorem with Volumes
- On the hardness of approximating minimization problems
- Linear programming — Randomization and abstract frameworks
- Quantitative Helly-Type Theorems
- Reducibility among Combinatorial Problems
- A combinatorial bound for linear programming and related problems
This page was built for publication: Helly-type theorems for approximate covering
