solidot新版网站常见问题,请点击这里查看。
消息
本文已被查看4940次
Covering compact metric spaces greedily. (arXiv:1710.06002v2 [math.MG] UPDATED)
来源于:arXiv
A general greedy approach to construct coverings of compact metric spaces by
metric balls is given and analyzed. The analysis is a continuous version of
Chvatal's analysis of the greedy algorithm for the weighted set cover problem.
The approach is demonstrated in an exemplary manner to construct efficient
coverings of the n-dimensional sphere and n-dimensional Euclidean space to give
short and transparent proofs of several best known bounds obtained from
deterministic constructions in the literature on sphere coverings. 查看全文>>