Better approximations for max TSP

We combine two known polynomial time approximation algorithms for the maximum traveling salesman problem to obtain a randomized algorithm which outputs a solution with expected value of at least r times the optimal one for any given r < 25/33.

• Type: Journal
• Year: 2000
• Where: IPL
• Authors: Refael Hassin, Shlomi Rubinstein
• Keywords: IPL 2000, Polynomial Time Approximation, Randomized Algorithm, Salesman Problem