{'fraction_non_alphanumeric': 0.01809954751131222, 'fraction_numerical': 0.0, 'mean_word_length': 5.384615384615385, '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}}
Computing Wireless Capacity∗

In this paper we address two common questions in wireless communication from an algorithmic perspective, assuming a geometric path loss model: First, how long does it take to satisfy an arbitrary set of wireless communication requests? Second, given a set of arbitrary communication requests, how many of them can be transmitted concurrently. Our main results are efficient algorithms that find a constant approximation for the second problem, and a logarithmic approximation for the first problem. In addition we present a robustness result, showing that constant parameter and model changes will modify a result only by a constant.