A better differential approximation ratio for symmetric TSP

Authors:
Bruno Escoffier;Jérôme Monnot
Affiliations:
CNRS-LAMSADE, Université Paris-Dauphine, Place du Maréchal De Lattre de Tassigny, F-75775 Paris Cedex 16, France;CNRS-LAMSADE, Université Paris-Dauphine, Place du Maréchal De Lattre de Tassigny, F-75775 Paris Cedex 16, France
Venue:
Theoretical Computer Science
Year:
2008

Citing 16
Cited 2

The traveling salesman problem with distances one and two

Mathematics of Operations Research
Approximation algorithms for indefinite quadratic programming

Mathematical Programming: Series A and B
Approximation results for the minimum graph coloring problem

Information Processing Letters
On an approximation measure founded on the links between optimization and polynomial approximation theory

Theoretical Computer Science
Approximation of k-set cover by semi-local optimization

STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
Differential approximation algorithms for some combinatorial optimization problems

Theoretical Computer Science
Approximating discrete collections via local improvements

Proceedings of the sixth annual ACM-SIAM symposium on Discrete algorithms
Better approximations for max TSP

Information Processing Letters
z-Approximations

Journal of Algorithms
A 7/8-approximation algorithm for metric Max TSP

Information Processing Letters
Differential approximation results for the traveling salesman and related problems

Information Processing Letters
Polynomial time approximation schemes for Euclidean TSP and other geometric problems

FOCS '96 Proceedings of the 37th Annual Symposium on Foundations of Computer Science
Approximation algorithms for some vehicle routing problems

Discrete Applied Mathematics
Improved deterministic approximation algorithms for Max TSP

Information Processing Letters
On the differential approximation of MIN SET COVER

Theoretical Computer Science
The maximum saving partition problem

Operations Research Letters

New differential approximation algorithm for k-customer vehicle routing problem

Information Processing Letters
Differential approximation of the multiple stacks TSP

ISCO'12 Proceedings of the Second international conference on Combinatorial Optimization

Quantified Score

Hi-index	5.23

Visualization

Abstract

In this paper, we study the approximability properties of symmetric TSP under an approximation measure called the differential ratio. More precisely, we improve up to 3/4-@e (for any @e0) the best differential ratio of 2/3 known so far, given in Hassin and Khuller, [R. Hassin, S. Khuller, z-approximations, J. Algorithms, 41 (2) (2001) 429-442].