{'fraction_non_alphanumeric': 0.02495697074010327, 'fraction_numerical': 0.008605851979345954, 'mean_word_length': 4.591346153846154, '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}}
On the problem of tracking mobile users in wireless communications networks

The tracking strategy for mobile users in wireless communication networks proposed by A. Bar-Noy and I. Kessler (1993) essentially finds a minimal set of reporting centers in the cellular network. The size of the set of reporting centers in the mobility graph, and the vicinity (i.e. the number of non reporting centers in the neighborhood of a reporting center) are measures of the cost of the two main operations, update and find, in the tracking problem. For arbitrary mobility graphs and for any vicinity value greater than 1, the problem has been shown to be NP complete. Optimal and near optimal solutions for special cases of the mobility graphs, including rings, grids, trees, were discussed by A. Bar-Noy and I. Kessler (1993). We propose optimal greedy algorithms to solve the reporting center problem for vicinity of size 2 in interval graphs and proper interval graphs. The heuristic that guides our greedy solutions is to make a vertex a reporting center if and only if it already has a non reporting center among its neighbors. The proposed algorithms run in linear time.