2000 character limit reached
The Asymmetric Traveling Salesman Problem on Graphs with Bounded Genus
Published 15 Sep 2009 in cs.DS and cs.DM | (0909.2849v4)
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.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.