{'fraction_non_alphanumeric': 0.0111731843575419, 'fraction_numerical': 0.0, 'mean_word_length': 5.107954545454546, '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}}
Problems on independence systems solvable by the greedy algorithm

Abstract One of the key results of the theory of matroids is the well-known Rado–Edmonds theorem which states that the problem of maximising an additive function on an independence system is solvable by the greedy algorithm if and only if the independence system is a matroid. Many generalisations of the Rado–Edmonds theorem were related in main with extension of the set of feasible solutions of the maximisation problem, as a rule an independence system was replaced by an accessible set system. Extension of the class of objective functions was also accompanied by extension of the feasible sets. In this paper, we investigate the maximisation problems of nonadditive functions of sets on independence systems. We suggest a characterisation of the class of objective functions of the problems on matroids which are solvable by the greedy algorithm. We proved a generalisation of the Rado–Edmonds theorem for the maximisation problem on the independence system of a nonadditive function of a given class.