Author:
Das Aparna,Mathieu Claire
Publisher
Springer Science and Business Media LLC
Subject
Applied Mathematics,Computer Science Applications,General Computer Science
Reference23 articles.
1. Adamaszek, A., Czumaj, A., Lingas, A.: PTAS for k-tour cover problem on the plane for moderately large values of k. Algorithms and Computation. Springer-Verlag, Berlin (2009)
2. Arora, S.: Polynomial time approximation schemes for Euclidean traveling salesman and other geometric problems. J. ACM 45(5), 753–782 (1998)
3. Arora, S.: Approximation schemes for NP-hard geometric optimization problems: A survey. Math. Program. 97(1–2), 43–69 (2003)
4. Arora, S., Karakostas, G.: Approximation schemes for minimum latency problems. SIAM J. Comput. 32(5), 1317–1337 (2003)
5. Asano, T., Katoh, N., Tamaki, H., Tokuyama, T.: Covering points in the plane by k-tours: a polynomial approximation scheme for fixed k. Research Report RT0162, IBM Tokyo Research Laboratory (1996)
Cited by
43 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献