The Internet Archive has a preservation copy of this work in our general collections.
The file type is application/pdf
.
The Asymmetric Traveling Salesman Problem on Graphs with Bounded Genus
[article]
2011
arXiv
pre-print
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.
arXiv:0909.2849v4
fatcat:dydpol4jcrdongnob5kvukkb6m