覆盖紧度量空间广义
Covering compact metric spaces greedily
摘要：
给出并分析了用度量球构造紧度量空间覆盖的一般贪婪方法。该分析是Chvatal分析加权集覆盖问题的贪婪算法的连续版本。该方法被证明是在一个示例性的方式来构建有效的覆盖的n维球体和n维欧几里得空间给出简短和透明的证明，几个最好的已知的界限，从确定性的结构在文献中的球体覆盖。
英文摘要：
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.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
