Sciweavers

Share
IPL
2000

Better approximations for max TSP

9 years 3 months ago
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.
Refael Hassin, Shlomi Rubinstein
Added 18 Dec 2010
Updated 18 Dec 2010
Type Journal
Year 2000
Where IPL
Authors Refael Hassin, Shlomi Rubinstein
Comments (0)
books