加载中…
2009-09-15
The Asymmetric Traveling Salesman Problem on Graphs with Bounded Genus
Shayan Oveis GharanAmin Saberi
文献摘要
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.
讨论
0讲解博客
生成讲解博客的中文版本
AI智能校验
生成AI智能校验的中文版本