Funder
Ministry of Science and Higher Education of the Russian Federation
Russian Foundation for Basic Research
Subject
History,General Mathematics
Reference52 articles.
1. The Traveling Salesman Problem — A Computational Study;Applegate,2006
2. Polynomial time approximation schemes for Euclidean traveling salesman and other geometric problems;Arora;J. ACM,1998
3. The traveling salesman problem: low-dimensionality implies a polynomial time approximation scheme;Bartal;SIAM J. Comput.,2016
4. The maximum TSP;Barvinok,2007
5. 8/7-approximation algorithm for (1, 2)-TSP;Berman,2006
Cited by
33 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献