{'fraction_non_alphanumeric': 0.02533783783783784, 'fraction_numerical': 0.0033783783783783786, 'mean_word_length': 4.59433962264151, 'pattern_counts': {'":': 0, '<': 0, '<?xml version=': 0, '>': 1, '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 Improved Algorithm for Inserting a Highway in a City Metric Based on Minimization of Quasiconvex Functions

We introduce an improved algorithm to locate a segment highway such that the maximum city distance between a given set of n points is minimized (where the city distance is measured with speed v > 1 on a highway and 1 in the underlying metric elsewhere). We consider that such highway is built in a complex transportation system with H other highways and obstacles. The algorithm runs in O(nH(log n + log H)) time using O(nH) space improving the previous O(nH) time and space bound.