An approximation algorithm for the maximum traveling salesman problem

The question considered in the travelling salesman problem is the following. For a given list of cities and the distances between each pair of cities, to construct the shortest possible path that visits each city exactly once and returns to the origin city. The problem is an NP-hard problem in combinatorial optimization and is important in operations research. The traveling salesman problem is one of the most famous and heavily researched problems in theoretical computer science. We consider the version, which is the Symmetric Maximum Traveling Salesman Problem. The article describes an approximation algorithm for the maximum traveling salesman problem, based on two known polynomial time approximation algorithms. The accuracy of this algorithm is 25/33.