{'fraction_non_alphanumeric': 0.014314928425357873, 'fraction_numerical': 0.018404907975460124, 'mean_word_length': 5.363636363636363, '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}}
An algorithm for the facility location problems

Variants of the facility location problem have been studied extensively in the operations research and management science literatures. In this paper, we present a new analysis method of a simple greedy algorithm for the uncapacitated facility location problem. We achieve an approximation guarantee of 1.5749 better than 1.853, which is the approximation ratio provided by the combinatorial approximation algorithm due to Charikar and Guha.