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. (C) 2000 Elsevier Science B.V. All rights reserved.
maximum traveling salesman analysis of algorithms maximum latency tsp