Approximating set multi-covers
From MaRDI portal
Publication:2408974
DOI10.1016/j.ejc.2017.08.001zbMath1371.05203arXiv1608.01292OpenAlexW2751256544MaRDI QIDQ2408974
Márton Naszódi, Aleksandr A. Polyanskii
Publication date: 10 October 2017
Published in: European Journal of Combinatorics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1608.01292
Related Items (3)
On the multiple illumination numbers of convex bodies ⋮ Chromatic numbers of spheres ⋮ Covering compact metric spaces greedily
Cites Work
- Unnamed Item
- Unnamed Item
- On weighted covering numbers and the Levi-Hadwiger conjecture
- Approximation algorithms for combinatorial problems
- On the ratio of optimal integral and fractional covers
- Coverings: variations on a result of Rogers and on the epsilon-net theorem of Haussler and Welzl
- Matchings and covers in hypergraphs
- Two combinatorial covering theorems
- On some covering problems in geometry
- A note on coverings
- Approximation algorithms for metric facility location and k -Median problems using the primal-dual schema and Lagrangian relaxation
- Multiple packing and covering of spheres
- Worst-Case Analysis of Greedy Heuristics for Integer Programming with Nonnegative Data
- Multiple packing and covering of the plane with circles
- Primal-Dual RNC Approximation Algorithms for Set Cover and Covering Integer Programs
- Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques
- Approximation and Online Algorithms
This page was built for publication: Approximating set multi-covers
