| Article ID: | iaor2008496 |
| Country: | Netherlands |
| Volume: | 13 |
| Issue: | 4 |
| Start Page Number: | 321 |
| End Page Number: | 336 |
| Publication Date: | May 2007 |
| Journal: | Journal of Combinatorial Optimization |
| Authors: | Chen Zhi-Zhong, Nagoya Takayuki |
| Keywords: | heuristics |
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 −