Improved deterministic approximation algorithms for Max TSP

Authors:
Zhi-Zhong Chen;Yuusuke Okamoto;Lusheng Wang
Affiliations:
Department of Mathematical Sciences, Tokyo Denki University, Hatoyama, Saitama 350-0394, Japan;Department of Mathematical Sciences, Tokyo Denki University, Hatoyama, Saitama 350-0394, Japan;Department of Computer Science, City University of Hong Kong, Tat Chee Avenue, Kowloon, Hong Kong
Venue:
Information Processing Letters
Year:
2005

Citing 6
Cited 11

Constructing a perfect matching is in random NC

Combinatorica
Matching is as easy as matrix inversion

Combinatorica
Parallel constructions of maximal path sets and applications to short superstrings

Theoretical Computer Science
An approximation algorithm for the maximum traveling salesman problem

Information Processing Letters
Better approximations for max TSP

Information Processing Letters
A 7/8-approximation algorithm for metric Max TSP

Information Processing Letters

Approximating Multi-criteria Max-TSP

ESA '08 Proceedings of the 16th annual European symposium on Algorithms
A 7/9 - Approximation Algorithm for the Maximum Traveling Salesman Problem

APPROX '09 / RANDOM '09 Proceedings of the 12th International Workshop and 13th International Workshop on Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques
Reoptimization of minimum and maximum traveling salesman's tours

Journal of Discrete Algorithms
Minimum-weight cycle covers and their approximability

WG'07 Proceedings of the 33rd international conference on Graph-theoretic concepts in computer science
Multiplying pessimistic estimators: deterministic approximation of max TSP and maximum triangle packing

COCOON'10 Proceedings of the 16th annual international conference on Computing and combinatorics
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
Reoptimization of minimum and maximum traveling salesman's tours

SWAT'06 Proceedings of the 10th Scandinavian conference on Algorithm Theory
Improved approximation algorithms for metric max TSP

ESA'05 Proceedings of the 13th annual European conference on Algorithms
Single approximation for biobjective max TSP

WAOA'11 Proceedings of the 9th international conference on Approximation and Online Algorithms
An improved approximation algorithm for the bandpass problem

FAW-AAIM'12 Proceedings of the 6th international Frontiers in Algorithmics, and Proceedings of the 8th international conference on Algorithmic Aspects in Information and Management
Deterministic approximation algorithms for the maximum traveling salesman and maximum triangle packing problems

Discrete Applied Mathematics

Quantified Score

Hi-index	0.89

Visualization

Abstract

We present an O(n^3)-time approximation algorithm for the maximum traveling salesman problem whose approximation ratio is asymptotically 6181, where n is the number of vertices in the input complete edge-weighted (undirected) graph. We also present an O(n^3)-time approximation algorithm for the metric case of the problem whose approximation ratio is asymptotically 1720. Both algorithms improve on the previous bests.