Improved approximation algorithms for metric max TSP

Authors:
Zhi-Zhong Chen;Takayuki Nagoya
Affiliations:
Dept. of Math. Sci., Tokyo Denki Univ., Hatoyama, Saitama, Japan;Dept. of Math. Sci., Tokyo Denki Univ., Hatoyama, Saitama, Japan
Venue:
ESA'05 Proceedings of the 13th annual European conference on Algorithms
Year:
2005

Citing 3
Cited 5

A 7/8-approximation algorithm for metric Max TSP

Information Processing Letters
Approximation Algorithms for Asymmetric TSP by Decomposing Directed Regular Multigraphs

FOCS '03 Proceedings of the 44th Annual IEEE Symposium on Foundations of Computer Science
Improved deterministic approximation algorithms for Max TSP

Information Processing Letters

Deterministic 7/8-Approximation for the Metric Maximum TSP

APPROX '08 / RANDOM '08 Proceedings of the 11th international workshop, APPROX 2008, and 12th international workshop, RANDOM 2008 on Approximation, Randomization and Combinatorial Optimization: Algorithms and Techniques
Two Approximation Algorithms for ATSP with Strengthened Triangle Inequality

WADS '09 Proceedings of the 11th International Symposium on Algorithms and Data Structures
Deterministic 7/8-approximation for the metric maximum TSP

Theoretical Computer Science
Approximation algorithms for restricted cycle covers based on cycle decompositions

WG'06 Proceedings of the 32nd international conference on Graph-Theoretic Concepts in Computer Science
Improved approximation algorithms for metric maximum ATSP and maximum 3-cycle cover problems

Operations Research Letters

Quantified Score

Hi-index	0.00

Visualization

Abstract

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 $\frac{27}{35}$. The other is for undirected graphs and its approximation ratio is $\frac{7}{8} - o(1)$. Both algorithms improve on the previous bests.