{'fraction_non_alphanumeric': 0.017921146953405017, 'fraction_numerical': 0.0, 'mean_word_length': 5.654761904761905, '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}}
Solving large scale channel allocation problems with splitting algorithms

The basic channel allocation problem (CAP) is known to be NP-hard. In this paper, splitting algorithms are proposed that significantly decrease computational load for centralized CAP algorithms by segmenting a problem, sequentially solving the smaller individual problems and then combining the solutions. This method is shown to have comparable performance with the non-splitting scheme for the same CAP algorithm. Experimental results using the random walk algorithm are presented.