13/9-approximation for Graphic TSP

Details 13/9-approximation for Graphic TSP 13/9-approximation for Graphic TSP

2011-08-04

arxiv.org/abs/1108.1130v2

Computer Science

Data Structures and Algorithms

Scientific paper

The Travelling Salesman Problem is one the most fundamental and most studied problems in approximation algorithms. For more than 30 years, the best algorithm known for general metrics has been Christofides's algorithm with approximation factor of 3/2, even though the so-called Held-Karp LP relaxation of the problem is conjectured to have the integrality gap of only 4/3. Very recently, significant progress has been made for the important special case of graphic metrics, first by Oveis Gharan et al., and then by Momke and Svensson. In this paper, we provide an improved analysis for the approach introduced by Momke and Svensson yielding a bound of 13/9 on the approximation factor, as well as a bound of 19/12+epsilon for any epsilon>0 for a more general Travelling Salesman Path Problem in graphic metrics.

Affiliated with

Also associated with

No associations

Rating

13/9-approximation for Graphic TSP does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with 13/9-approximation for Graphic TSP, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and 13/9-approximation for Graphic TSP will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-14874