Improved Approximation Algorithms for Metric Max TSP

@inproceedings{Chen2005ImprovedAA,
  title={Improved Approximation Algorithms for Metric Max TSP},
  author={Zhi-Zhong Chen and Takayuki Nagoya},
  booktitle={ESA},
  year={2005}
}
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 78−o(1). Both algorithms improve on the previous bests. 

References

Publications referenced by this paper.
Showing 1-7 of 7 references

Polynomial Algorithms with the Estimates 34 and 5 6 for the Traveling Salesman Problem of Maximum (in Russian)

  • A. V. Kostochka, A. I. Serdyukov
  • Upravlyaemye Sistemy,
  • 1985
Highly Influential
6 Excerpts

Similar Papers

Loading similar papers…