The Asymmetric Traveling Salesman Problem on Graphs with Bounded Genus
published by Shayan Oveis Gharan
in 2009
in Informatics Engineering
and research's language is
English
Download
Abstract in English
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.