Publisher
Springer Berlin Heidelberg
Reference15 articles.
1. Arora, S.: Polynomial time approximation schemes for Euclidean traveling salesman and other geometric problems. Journal of the ACM 45(5), 753–782 (1998)
2. Berman, P., Karpinski, M.: 8/7-Approximation Algorithm for (1,2)-TSP. In: Proceedings of 17th ACM-SIAM Symposium on Discrete Algorithms, pp. 641–648. ACM Press, New York (2006)
3. Blaser, M.: A New Approximation Algorithm for the Asymmetric TSP with Triangle inequality. In: Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pp. 638–645 (2002)
4. Charikar, M., Goemans, M.X., Karloff, H.: On the Integrality Ratio for the Asymmetric Traveling Salesman Problem. Mathematics of Operations Research 31, 245–252 (2006)
5. Chekuri, C., Pal, M.: An O(logn) Approximation Ratio for the Asymmetric Travelling Salesman Path Problem. In: 9th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems (APPROX), pp. 95–103 (2006)
Cited by
27 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献