Sciweavers

Share
ESA
2005
Springer

Improved Approximation Algorithms for Metric Max TSP

9 years 9 months ago
Improved Approximation Algorithms for Metric Max TSP
We present two polynomial-time approximation algorithms for the metric case of the maximum traveling salesman problem. One of them is for directed graphs and its approximation ratio is 27 35 . The other is for undirected graphs and its approximation ratio is 7 8 −o(1). Both algorithms improve on the previous bests.
Zhi-Zhong Chen, Takayuki Nagoya
Added 27 Jun 2010
Updated 27 Jun 2010
Type Conference
Year 2005
Where ESA
Authors Zhi-Zhong Chen, Takayuki Nagoya
Comments (0)
books