The Asymmetric Traveling Salesman Problem on Graphs with Bounded Genus
The Asymmetric Traveling Salesman Problem on Graphs with Bounded Genus
Previous chapter Next chapter Full AccessProceedings Proceedings of the 2011 Annual ACM-SIAM Symposium on Discrete Algorithms (SODA)The Asymmetric Traveling Salesman Problem on Graphs with Bounded GenusShayan Oveis Gharan and Amin SaberiShayan Oveis Gharan and Amin Saberipp.967 - 975Chapter DOI:https://doi.org/10.1137/1.9781611973082.75PDFBibTexSections ToolsAdd to favoritesExport CitationTrack CitationsEmail SectionsAboutAbstract We give a constant factor …