The Geometric Maximum Traveling Salesman Problem

by   Alexander Barvinok, et al.

We consider the traveling salesman problem when the cities are points in R^d for some fixed d and distances are computed according to geometric distances, determined by some norm. We show that for any polyhedral norm, the problem of finding a tour of maximum length can be solved in polynomial time. If arithmetic operations are assumed to take unit time, our algorithms run in time O(n^f-2 log n), where f is the number of facets of the polyhedron determining the polyhedral norm. Thus for example we have O(n^2 log n) algorithms for the cases of points in the plane under the Rectilinear and Sup norms. This is in contrast to the fact that finding a minimum length tour in each case is NP-hard. Our approach can be extended to the more general case of quasi-norms with not necessarily symmetric unit ball, where we get a complexity of O(n^2f-2 log n). For the special case of two-dimensional metrics with f=4 (which includes the Rectilinear and Sup norms), we present a simple algorithm with O(n) running time. The algorithm does not use any indirect addressing, so its running time remains valid even in comparison based models in which sorting requires Omega(n n) time. The basic mechanism of the algorithm provides some intuition on why polyhedral norms allow fast algorithms. Complementing the results on simplicity for polyhedral norms, we prove that for the case of Euclidean distances in R^d for d>2, the Maximum TSP is NP-hard. This sheds new light on the well-studied difficulties of Euclidean distances.


page 1

page 2

page 3

page 4


Geometric Hitting Set for Line-Constrained Disks and Related Problems

Given a set P of n weighted points and a set S of m disks in the plane, ...

Parameterized Approximation Algorithms for k-Center Clustering and Variants

k-center is one of the most popular clustering models. While it admits a...

Covering convex bodies and the Closest Vector Problem

We present algorithms for the (1+ϵ)-approximate version of the closest v...

Fast Distance Oracles for Any Symmetric Norm

In the Distance Oracle problem, the goal is to preprocess n vectors x_1,...

Sparsifying Sums of Norms

For any norms N_1,…,N_m on ℝ^n and N(x) := N_1(x)+⋯+N_m(x), we show ther...

The 2-connected bottleneck Steiner network problem is NP-hard in any ℓ_p plane

Bottleneck Steiner networks model energy consumption in wireless ad-hoc ...

On Finding Maximum Cardinality Subset of Vectors with a Constraint on Normalized Squared Length of Vectors Sum

In this paper, we consider the problem of finding a maximum cardinality ...

Please sign up or login with your details

Forgot password? Click here to reset