A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is
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. : S 0 0 2 0 -0 1 9 0 ( 0 0 ) 0 0 0 9 7 -1doi:10.1016/s0020-0190(00)00097-1 fatcat:xm7tt3dhafe6pgog3piivrl7ji