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 combinatorial45 – approximation algorithm for Max TSP. The previous best approximation for this problem was79. The new algorithm is based on a technique of eliminating difficult subgraphs via gadgets with half-edges, a new method of edge coloring and a technique of exchanging edges.
Cite
CITATION STYLE
Dudycz, S., Marcinkowski, J., Paluch, K., & Rybicki, B. (2017). A 4/5 - approximation algorithm for the maximum traveling salesman problem. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 10328 LNCS, pp. 173–185). Springer Verlag. https://doi.org/10.1007/978-3-319-59250-3_15
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
