The asymmetric traveling salesman problem on graphs with bounded genus

Authors:
Shayan Oveis Gharan;Amin Saberi
Affiliations:
Stanford University, Stanford, CA;Stanford University, Stanford, CA
Venue:
Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete Algorithms
Year:
2011

Citing 17
Cited 0

Nowhere-zero flows

Handbook of combinatorics (vol. 1)
Embedding graphs in an arbitrary surface in linear time

STOC '96 Proceedings of the twenty-eighth annual ACM symposium on Theory of computing
Polynomial time approximation schemes for Euclidean traveling salesman and other geometric problems

Journal of the ACM (JACM)
A polynomial-time approximation scheme for weighted planar graph TSP

Proceedings of the ninth annual ACM-SIAM symposium on Discrete algorithms
Towards a 4/3 approximation for the asymmetric traveling salesman problem

SODA '00 Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms
High-girth graphs avoiding a minor are nearly bipartite

Journal of Combinatorial Theory Series B
A new approximation algorithm for the asymmetric TSP with triangle inequality

SODA '03 Proceedings of the fourteenth annual ACM-SIAM symposium on Discrete algorithms
An approximation scheme for planar graph TSP

FOCS '95 Proceedings of the 36th Annual Symposium on Foundations of Computer Science
Minimizing the stabbing number of matchings, trees, and triangulations

SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms
Approximation algorithms for asymmetric TSP by decomposing directed regular multigraphs

Journal of the ACM (JACM)
A linear-time approximation scheme for planar weighted TSP

FOCS '05 Proceedings of the 46th Annual IEEE Symposium on Foundations of Computer Science
Minimum Bounded Degree Spanning Trees

FOCS '06 Proceedings of the 47th Annual IEEE Symposium on Foundations of Computer Science
On the Integrality Ratio for the Asymmetric Traveling Salesman Problem

Mathematics of Operations Research
Approximation algorithms via contraction decomposition

SODA '07 Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms
Circular flows of nearly Eulerian graphs and vertex-splitting

Journal of Graph Theory
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

Quantified Score

Hi-index	0.00

Visualization

Abstract

We give a constant factor approximation algorithm for the asymmetric traveling salesman problem when the support graph of the solution of the Held-Karp linear programming relaxation has bounded orientable genus.