{'fraction_non_alphanumeric': 0.08312128922815945, 'fraction_numerical': 0.007633587786259542, 'mean_word_length': 4.645933014354067, 'pattern_counts': {'":': 0, '<': 28, '<?xml version=': 0, '>': 28, '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}}
Improved lower and upper bounds for universal TSP in planar metrics

A universal TSP tour of a metric space is a total ordering of the points of the space such that for any finite subset, the tour which visits these points in the given order is not too much longer than the optimal tour. There is a vast literature on the TSP problem, and universal TSP tours have been studied since the 1980's when Bartholdi and Platzman [29] introduced the spacefilling curve heuristic for the Euclidean TSP problem and conjectured that there exists a constant-competitive universal TSP tour based on this heuristic. Here, we settle this conjecture negatively by proving an Ω (6√log <i>n</i>/log log <i>n</i>) lower bound for universal TSP tours of the <i>n</i> × <i>n</i> grid; this is the first known example of a family of finite metrics with no constant-competitive universal tour.Generalizing from the <i>n</i> × <i>n</i> grid to arbitrary weighted planar graph metrics, and more generally <i>H</i>-minor-free metrics, we improve the best known upper bound for universal tours of such metrics from <i>O</i>(log<sup>4</sup> <i>n</i>/ log log <i>n</i>) to <i>O</i>(log<sup>2</sup> <i>n</i>).