On the Integrality Ratio for the Asymmetric Traveling Salesman Problem

Authors:
Moses Charikar;Michel X. Goemans;Howard Karloff
Affiliations:
Department of Computer Science, Princeton University, 35 Olden Street, Princeton, New Jersey 08540, USA;Department of Mathematics, Massachusetts Institute of Technology, 77 Massachusetts Avenue, Cambridge, Massachusetts 02139, USA;AT&T Labs---Research, 180 Park Avenue, Florham Park, New Jersey 07932, USA
Venue:
Mathematics of Operations Research
Year:
2006

Citing 13
Cited 7

Minimum-weight two-connected spanning networks

Mathematical Programming: Series A and B
Analyzing the Held-Karp TSP bound: a monotonicity property with application

Information Processing Letters
Optimizing over the subtour polytope of the travelling salesman problem

Mathematical Programming: Series A and B
Survivable networks, linear programming relaxations and the parsimonious property

Mathematical Programming: Series A and B
Molecular computation of solutions to combinatorial problems

Science
Polynomial time approximation schemes for Euclidean traveling salesman and other geometric problems

Journal of the ACM (JACM)
Guillotine Subdivisions Approximate Polygonal Subdivisions: A Simple Polynomial-Time Approximation Scheme for Geometric TSP, k-MST, and Related Problems

SIAM Journal on Computing
Asymptotic experimental analysis for the Held-Karp traveling salesman bound

Proceedings of the seventh annual ACM-SIAM symposium on Discrete algorithms
On the approximability of the traveling salesman problem (extended abstract)

STOC '00 Proceedings of the thirty-second annual ACM symposium on Theory of computing
A new approximation algorithm for the asymmetric TSP with triangle inequality

SODA '03 Proceedings of the fourteenth annual ACM-SIAM symposium on Discrete algorithms
Finding the Exact Integrality Gap for Small Traveling Salesman Problems

Proceedings of the 9th International IPCO Conference on Integer Programming and Combinatorial Optimization
Approximation Algorithms for Asymmetric TSP by Decomposing Directed Regular Multigraphs

FOCS '03 Proceedings of the 44th Annual IEEE Symposium on Foundations of Computer Science
Ant system: optimization by a colony of cooperating agents

IEEE Transactions on Systems, Man, and Cybernetics, Part B: Cybernetics

Improved Approximation Ratios for Traveling Salesperson Tours and Paths in Directed Graphs

APPROX '07/RANDOM '07 Proceedings of the 10th International Workshop on Approximation and the 11th International Workshop on Randomization, and Combinatorial Optimization. Algorithms and Techniques
An O(log n/ log log n)-approximation algorithm for the asymmetric traveling salesman problem

SODA '10 Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete Algorithms
Approximation algorithms for the directed k-tour and k-stroll problems

APPROX/RANDOM'10 Proceedings of the 13th international conference on Approximation, and 14 the International conference on Randomization, and combinatorial optimization: algorithms and techniques
The asymmetric traveling salesman problem on graphs with bounded genus

Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete Algorithms
A rounding by sampling approach to the minimum size k-arc connected subgraph problem

ICALP'12 Proceedings of the 39th international colloquium conference on Automata, Languages, and Programming - Volume Part I
An improved integrality gap for asymmetric TSP paths

IPCO'13 Proceedings of the 16th international conference on Integer Programming and Combinatorial Optimization
On integrality ratios for asymmetric TSP in the sherali-adams hierarchy

ICALP'13 Proceedings of the 40th international conference on Automata, Languages, and Programming - Volume Part I

Quantified Score

Hi-index	0.00

Visualization

Abstract

We improve the lower bound on the integrality ratio of the Held-Karp bound for asymmetric TSP with triangle inequality from 4/3 to 2.