Author:
Blauth Jannis,Traub Vera,Vygen Jens
Publisher
Springer International Publishing
Reference22 articles.
1. Adamaszek, A., Czumaj, A., Lingas, A.: PTAS for $$k$$-tour cover problem on the plane for moderately large values of $$k$$. Int. J. Found. Comput. Sci. 21, 893–904 (2010)
2. Altinkemer, K., Gavish, B.: Heuristics for unequal weight delivery problems with a fixed error guarantee. Oper. Res. Lett. 6, 149–158 (1987)
3. 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: Proceedings of the Annual ACM Symposium on Theory of Computing (STOC), pp. 275–283 (1997)
4. Asano, T., Katoh, N., Kawashima, K.: A new approximation algorithm for the capacitated vehicle routing problem on a tree. J. Comb. Optim. 5, 213–231 (2001)
5. Becker, A.: A tight 4/3 approximation for capacitated vehicle routing in trees. In: Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM), pp. 3:1–3:15 (2018)
Cited by
8 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献