Author:
Friggstad Zachary,Mousavi Ramin,Rahgoshay Mirmahdi,Salavatipour Mohammad R.
Publisher
Springer International Publishing
Reference25 articles.
1. Lecture Notes in Computer Science;A Adamaszek,2009
2. Altinkemer, K., Gavish, B.: Heuristics for unequal weight delivery problems with a fixed error guarantee. Oper. Res. Lett. 6(4), 149–158 (1987). https://www.sciencedirect.com/science/article/pii/0167637787900125
3. Arora, S.: Polynomial time approximation schemes for euclidean traveling salesman and other geometric problems. J. ACM 45(5), 753–782 (1998)
4. Asano, T., Katoh, N., Tamaki, H., Tokuyama, T.: Covering points in the plane by k-tours: Towards a polynomial time approximation scheme for general k. In: 29th ACM Symposium on the Theory of Computing (STOC), pp. 275–283 (1997)
5. Becker, A.: A tight 4/3 approximation for capacitated vehicle routing in trees. In: 21st International Conference on Approximation Algorithms for Combinatorial Optimization Problems (APPROX), pp. 3:1–3:15 (2018)
Cited by
4 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献