The Asymmetric Traveling Salesman Problem on Graphs with Bounded Genus
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.
Sorry, we are unable to provide the full text but you may find it at the following location(s):
http://citeseerx.ist.psu.edu/v... (external link)
http://www.stanford.edu/%7Esab... (external link)