Covering compact metric spaces greedily

DOI10.1007/s10474-018-0829-4zbMath1459.52015arXiv1710.06002OpenAlexW3100454277WikidataQ129869620 ScholiaQ129869620MaRDI QIDQ722361

J. H. Rolfes, Frank Vallentin

Publication date: 23 July 2018

Published in: Acta Mathematica Hungarica (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1710.06002

zbMATH Keywords

greedy algorithmset covergeometric covering problem

Mathematics Subject Classification ID

Combinatorial optimization (90C27) Packing and covering in (n) dimensions (aspects of discrete geometry) (52C17)

Related Items (4)

On a relationship between the Hausdorff measure and the density of the thinnest covering of \(\mathbb{R}^n\) ⋮ On a relation between packing and covering densities of convex bodies ⋮ On the monotonicity of the isoperimetric quotient for parallel bodies ⋮ On the density of the thinnest covering of \(\mathbb{R}^n\)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• A mathematical introduction to compressive sensing
• Weighted covering numbers of convex sets
• On weighted covering numbers and the Levi-Hadwiger conjecture
• Approximation algorithms for combinatorial problems
• On the ratio of optimal integral and fractional covers
• Chromatic numbers of spheres
• Two combinatorial covering theorems
• Approximating set multi-covers
• Covering spheres with spheres
• On the mathematical foundations of learning
• On some covering problems in geometry
• A Note on Covering by Convex Bodies
• A Greedy Heuristic for the Set-Covering Problem
• Analytical approach to parallel repetition

This page was built for publication: Covering compact metric spaces greedily