# Algorithms for finding minimal ball covers

My question is whether there exist algorithms to determine a minimal (or close to minimal) cover of a Riemannian manifold (or some subset thereof) with balls of a fixed radius r>0.

(1) Chepoi, Victor, and Bertrand Estellon. "Packing and covering $$\delta$$-hyperbolic spaces by balls." In Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, pp. 59-73. Springer, Berlin, Heidelberg, 2007. Springer link.
My understanding is that Singhof links the covering number $$B(M)$$ of a manifold $$M$$ to the Lusternik-Schnirelmann category $$\operatorname{cat} M$$ of a manifold.