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, Japan and City University of Hong Kong;Department of Mathematical Sciences, Tokyo Denki University, Hatoyama, Saitama, Japan;Department of Computer Science, City University of Hong Kong, Kowloon, Hong Kong
Venue:
Information Processing Letters
Year:
2005

Citing 6
Cited 2

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

A better differential approximation ratio for symmetric TSP

Theoretical Computer Science
Minimum-weight cycle covers and their approximability

Discrete Applied Mathematics

Quantified Score

Hi-index	0.89

Visualization

Abstract

We present an O(n3)-time approximation algorithm for the maximum traveling salesman problem whose approximation ratio is asymptotically 61/81 where n is the number of vertices in the input complete edge-weighted (undirected) graph. We also present an O(n3)-time approximation algorithm for the metric case of the problem whose approximation ratio is asymptotically 17/20. Both algorithms improve on the previous bests.