# A Randomized Rounding Approach to the Traveling Salesman Problem

@article{Gharan2011ARR,
title={A Randomized Rounding Approach to the Traveling Salesman Problem},
author={Shayan Oveis Gharan and Amin Saberi and Mohit Singh},
journal={2011 IEEE 52nd Annual Symposium on Foundations of Computer Science},
year={2011},
pages={550-559}
}
• Published 22 October 2011
• Computer Science, Mathematics
• 2011 IEEE 52nd Annual Symposium on Foundations of Computer Science
For some positive constant \eps_0, we give a (3/2-\eps_0)-approximation algorithm for the following problem: given a graph G_0=(V,E_0), find the shortest tour that visits every vertex at least once. This is a special case of the metric traveling salesman problem when the underlying metric is defined by shortest path distances in G_0. The result improves on the 3/2-approximation algorithm due to Christofides [C76] for this special case. Similar to Christofides, our algorithm finds a spanning…
177 Citations

## Figures from this paper

LP-Based Approximation Algorithms for Traveling Salesman Path Problems
• Computer Science
ArXiv
• 2011
It is shown that the recent result of Oveis Gharan, Saberi and Singh on the traveling salesman circuit problem under the unit-weight graphical metric can be modified for the path case to complement Hoogeveen's algorithm in the critical case, providing an improved performance guarantee of (5/3 - epsilon).
Approximation Algorithms for Traveling Salesman Problems Based on Linear Programming Relaxations
This thesis presents the first nontrivial approximation algorithm for this problem by giving a novel algorithmic technique to shortcut Eulerian circuits while bounding the lengths of the shortcuts needed, and achieves an O(log n/ log log n)-approximation algorithm.
Towards improving Christofides algorithm for half-integer TSP
• Computer Science, Mathematics
ESA
• 2019
The main result is to show that y can be written as a convex combination of tours for some positive constant $\epsilon, which has several applications and gives an alternative algorithm for the recently studied uniform cover problem. Reassembling Trees for the Traveling Salesman • J. Vygen • Computer Science SIAM J. Discret. Math. • 2016 This work argues that an additional step can help: reassembling the spanning trees before sampling, and develops a deterministic polynomial-time algorithm that improves on Sebo's previously best approximation ratio of$\frac{8}{5}\$.
An Experimental Evaluation of the Best-of-Many Christofides’ Algorithm for the Traveling Salesman Problem
• Computer Science
Algorithmica
• 2017
An experimental evaluation of the Best-of-Many Christofides’ algorithm for the traveling salesman problem to see if there are empirical reasons to believe its performance is better than that of Christofide’s algorithm.
An Improved Upper Bound for the Universal TSP on the Grid
• Mathematics, Computer Science
SODA
• 2017
This work disproves the conjecture that any universal ordering has a logarithmic lower bound for the n × n grid with competitive ratio of [EQUATION], and defines a universal ordering of the grid's vertices based on a generalization of the Lebesgue space-filling curve.
The traveling salesman problem on cubic and subcubic graphs
• Mathematics, Computer Science
Math. Program.
• 2014
It is proved constructively that for any cubic graph on n vertices a tour of length 4n/3-2 exists, which also implies the 4/ 3-conjecture, as an upper bound, for this class of graph-TSP, which is known to be NP-hard.
Approximating ATSP by Relaxing Connectivity
• O. Svensson
• Computer Science
2015 IEEE 56th Annual Symposium on Foundations of Computer Science
• 2015
It is shown that any algorithm (irrespective of the metric) for the relaxed problem can be turned into an algorithm for the asymmetric traveling salesman problem by only losing a small constant factor in the performance guarantee.
New Approaches to the Asymmetric Traveling Salesman and Related Problems
The Asymmetric Traveling Salesman Problem and its variants are optimization problems that are widely studied from the viewpoint of approximation algorithms as well as hardness of approximation. The
A Permanent Approach to the Traveling Salesman Problem
• Nisheeth K. Vishnoi
• Mathematics
2012 IEEE 53rd Annual Symposium on Foundations of Computer Science
• 2012
The techniques in this paper suggest new permanent-based approaches for TSP which could be useful in attacking other interesting cases of TSP.

## References

SHOWING 1-10 OF 52 REFERENCES
The Traveling-Salesman Problem and Minimum Spanning Trees
• Computer Science
Oper. Res.
• 1970
It is shown that maxπwπ = C* precisely when a certain well-known linear program has an optimal solution in integers.
LP-Based Approximation Algorithms for Traveling Salesman Path Problems
• Computer Science
ArXiv
• 2011
It is shown that the recent result of Oveis Gharan, Saberi and Singh on the traveling salesman circuit problem under the unit-weight graphical metric can be modified for the path case to complement Hoogeveen's algorithm in the critical case, providing an improved performance guarantee of (5/3 - epsilon).
Minimum Bounded Degree Spanning Trees
• M. Goemans
• Mathematics, Computer Science
2006 47th Annual IEEE Symposium on Foundations of Computer Science (FOCS'06)
• 2006
The result generalizes to the setting where every vertex has both upper and lower bounds and gives then a spanning tree which violates the bounds by at most two units and whose cost is at most the cost of the optimum tree.
Worst-Case Analysis of a New Heuristic for the Travelling Salesman Problem
An O(n3) heuristic algorithm is described for solving d-city travelling salesman problems (TSP) whose cost matrix satisfies the triangularity condition and a worst-case analysis of this heuristic shows that the ratio of the answer obtained to the optimum TSP solution is strictly less than 3/2.
TSP on Cubic and Subcubic Graphs
• Mathematics, Computer Science
IPCO
• 2011
It is proved that, as an upper bound, the 4/3 conjecture is true for this problem on cubic graphs, and a polynomial-time 7/5-approximation algorithm and a 7/ 5 bound on the integrality gap are obtained.
Approximating Graphic TSP by Matchings
• Computer Science, Mathematics
2011 IEEE 52nd Annual Symposium on Foundations of Computer Science
• 2011
A framework for approximating the metric TSP based on a novel use of matchings that allows for generalizations in a natural way and also leads to a 1.586-approximation algorithm for the traveling salesman path problem on graphic metrics where the start and end vertices are prespecified.
Minimum-weight two-connected spanning networks
• Mathematics
Math. Program.
• 1990
We consider the problem of constructing a minimum-weight, two-connected network spanning all the points in a setV. We assume a symmetric, nonnegative distance functiond(·) defined onV × V which
A linear-time approximation scheme for planar weighted TSP
• P. Klein
• Computer Science
46th Annual IEEE Symposium on Foundations of Computer Science (FOCS'05)
• 2005
An algorithm requiring O(c/sup 1/c2/ n) time to find an /spl epsi/-optimal traveling salesman tour in the metric defined by a planar graph with nonnegative edge-lengths is given.
An Improved Upper Bound for TSP in Cubic 3-Connected Graphs
• Mathematics, Computer Science
• 2005
One main result is an approximation algorithm for the minimum TSP on this class of graphs with an approximation factor better than the general 3/2.