Corpus ID: 235125493

A (Slightly) Improved Bound on the Integrality Gap of the Subtour LP for TSP

  title={A (Slightly) Improved Bound on the Integrality Gap of the Subtour LP for TSP},
  author={A. Karlin and Nathan Klein and S. Gharan},
We show that for some e > 10−36 and any metric TSP instance, the max entropy algorithm returns a solution of expected cost at most 2 − e times the cost of the optimal solution to the subtour elimination LP. This implies that the integrality gap of the subtour LP is at most 2 − e. This analysis also shows that there is a randomized 2 − e approximation for the 2-edgeconnected multi-subgraph problem, improving upon Christofides’ algorithm. * Research supported by Air Force… Expand

Figures from this paper


Towards improving Christofides algorithm for half-integer TSP
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. Expand
A Randomized Rounding Approach to the Traveling Salesman Problem
This work gives a (3/2-\eps_0)-approximation algorithm that finds a spanning tree whose cost is upper bounded by the optimum, then it finds the minimum cost Eulerian augmentation (or T-join) of that tree. Expand
The Traveling-Salesman Problem and Minimum Spanning Trees
It is shown that maxπwπ = C* precisely when a certain well-known linear program has an optimal solution in integers. Expand
New Inapproximability Bounds for TSP
This paper constructs here two new bounded occurrence CSP reductions which improve these bounds to 123/122 and 75/74, respectively, the first improvement in more than a decade for the case of the asymmetric TSP. Expand
A representation of cuts within 6/5 times the edge connectivity with applications
  • A. Benczúr
  • Mathematics, Computer Science
  • Proceedings of IEEE 36th Annual Foundations of Computer Science
  • 1995
This paper gives an O(n/sup 2/)-sized planar geometric representation for all edge cuts with capacity less than 6/5c, and shows that in algorithms based on edge splitting, computing this representation O(log n) times substitute for one, or sometimes even /spl Omega/(n), u-/spl nu/ mincut computations can lead to significant savings. Expand
Cut structures and randomized algorithms in edge-connectivity problems
Recently, major steps have been made to develop non-flow based approximate and exact algorithms that find min-cuts very efficiently. While finding s-t min-cuts (min-cuts that separate a given nodeExpand
Maximum Entropy Distributions: Bit Complexity and Stability
The results put max-entropy distributions on a mathematically sound footing -- these distributions are robust and computationally feasible models for data. Expand
An O(log n/ log log n)-approximation Algorithm for the Asymmetric Traveling Salesman Problem
A randomized algorithm is derived which delivers a solution within a factor O(log n/ log log n) of the optimum of the Asymmetric Traveling Salesman problem with high probability. Expand
The Traveling Salesman Problem: A Computational Study (Princeton Series in Applied Mathematics)
The authors are the same pioneers who for nearly two decades have led the investigation into the traveling salesman problem, and here they describe the method and computer code they used to solve a broad range of large-scale problems, and along the way they demonstrate the interplay of applied mathematics with increasingly powerful computing platforms. Expand
Shorter Tours by Nicer Ears
1 Extremely Nice Ears Suppose we have a graph G = (V,E) with an ear decomposition with the following properties (after deleting the trivial ears): 1. all short (consisting of 3 edges or less) earsExpand