Author:
Khachay Michael,Zaytseva Helen
Publisher
Springer International Publishing
Reference20 articles.
1. Adamaszek, C., Czumaj, A., Lingas, A.: PTAS for k-tour cover problem on the plane for moderately large values of k. Manuscript 1 (2009)
2. Arora, S.: Polynomial time approximation schemes for Euclidean traveling salesman and other geometric problems. J. ACM 45(5), 753–782 (1998)
3. Asano, T., Katoh, N., Tamaki, H., Tokuyama, T.: Covering points in the plane by k-tours: a polynomial time approximation scheme for fixed k. IBM Tokyo Research (1996)
4. Caric, T., Gold, H.: Vehicle Routing Problem. InTech (2008)
5. Christofides, N.: Worst-case analysis of a new heuristic for the traveling salesman problem. In: Symposium on New Directions and Recent Results in Algorithms and Complexity, p. 441 (1975)
Cited by
18 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献