A $4/5$ - Approximation Algorithm for the Maximum Traveling Salesman Problem
Data Structures and Algorithms
2016-03-22 v2 Discrete Mathematics
Abstract
In the maximum traveling salesman problem (Max TSP) we are given a complete undirected graph with nonnegative weights on the edges and we wish to compute a traveling salesman tour of maximum weight. We present a fast combinatorial - approximation algorithm for Max TSP. The previous best approximation for this problem was . The new algorithm is based on a novel technique of eliminating difficult subgraphs via half-edges, a new method of edge coloring and a technique of exchanging edges. A half-edge of edge is informally speaking "a half of containing either or ".
Cite
@article{arxiv.1512.09236,
title = {A $4/5$ - Approximation Algorithm for the Maximum Traveling Salesman Problem},
author = {Szymon Dudycz and Jan Marcinkowski and Katarzyna Paluch and Bartosz Rybicki},
journal= {arXiv preprint arXiv:1512.09236},
year = {2016}
}