Author:
Kowalik Łukasz,Mucha Marcin
Publisher
Springer Berlin Heidelberg
Reference11 articles.
1. Lecture Notes in Computer Science;M. Bläser,2003
2. Bläser, M., Manthey, B., Sgall, J.: An improved approximation algorithm for the asymmetric tsp with strengthened triangle inequality. J. Discrete Algorithms 4(4), 623–632 (2006)
3. Chandran, L.S., Ram, L.S.: On the relationship between atsp and the cycle cover problem. Theor. Comput. Sci. 370(1-3), 218–228 (2007)
4. Lecture Notes in Computer Science;Z.-Z. Chen,2005
5. Christofides, N.: Worst-case analysis of a new heuristic for the travelling salesman problem. Technical Report 388, Graduate School of Industrial Administration, CMU (1976)
Cited by
2 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献