The Asymmetric Traveling Salesman Problem on Graphs with Bounded Genus
classification
💻 cs.DS
cs.DM
keywords
asymmetricboundedgenusproblemsalesmantravelingalgorithmapproximation
read the original 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.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.