Rolfes, J. H. and Vallentin, F. (2018). Covering compact metric spaces greedily. Acta Math. Hung., 155 (1). S. 130 - 141. DORDRECHT: SPRINGER. ISSN 1588-2632

Full text not available from this repository.

Abstract

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 constructions in the literature on sphere coverings.

Item Type: Journal Article
Creators:
CreatorsEmailORCIDORCID Put Code
Rolfes, J. H.UNSPECIFIEDUNSPECIFIEDUNSPECIFIED
Vallentin, F.UNSPECIFIEDUNSPECIFIEDUNSPECIFIED
URN: urn:nbn:de:hbz:38-184616
DOI: 10.1007/s10474-018-0829-4
Journal or Publication Title: Acta Math. Hung.
Volume: 155
Number: 1
Page Range: S. 130 - 141
Date: 2018
Publisher: SPRINGER
Place of Publication: DORDRECHT
ISSN: 1588-2632
Language: English
Faculty: Unspecified
Divisions: Unspecified
Subjects: no entry
Uncontrolled Keywords:
KeywordsLanguage
MathematicsMultiple languages
Refereed: Yes
URI: http://kups.ub.uni-koeln.de/id/eprint/18461

Downloads

Downloads per month over past year

Altmetric

Export

Actions (login required)

View Item View Item