{'fraction_non_alphanumeric': 0.012704174228675136, 'fraction_numerical': 0.0, 'mean_word_length': 5.133333333333334, 'pattern_counts': {'":': 0, '<': 0, '<?xml version=': 0, '>': 0, 'https://': 0, 'lorem ipsum': 0, 'www.': 0, 'xml': 0}, 'pii_count': 0, 'substrings_counts': 0, 'word_list_counts': {'cursed_substrings.json': 0, 'profanity_word_list.json': 0, 'sexual_word_list.json': 0, 'zh_pornsignals.json': 0}}
A Survey on Capacitated Covering and Related Problems

The Capacitated Covering Problem is a natural generalization of classical covering problems that takes quantified demand-to-supply assignment model into consideration. In recent years, this problem has received more and more attention, and a rich body of research progress has been made not only on this problem itself but also on its natural extensions and variations. In this paper we present a literature survey on the capacitated covering problem and the research progress that has been made.