Author:
Becker Amariah,Paul Alice
Publisher
Springer International Publishing
Reference16 articles.
1. Asano, T., Katoh, N., Kawashima, K.: A new approximation algorithm for the capacitated vehicle routing problem on a tree. J. Comb. Optim. 5(2), 213–231 (2001).
https://doi.org/10.1023/A:1011461300596
2. Becker, A.: A tight 4/3 approximation for capacitated vehicle routing in trees. CoRR abs/1804.08791 (2018).
http://arxiv.org/abs/1804.08791
3. Bock, A., Grant, E., Könemann, J., Sanità, L.: The school bus problem on trees. Algorithmica 67(1), 49–64 (2013).
https://doi.org/10.1007/s00453-012-9711-x
4. Chen, L., Marx, D.: Covering a tree with rooted subtrees-parameterized and approximation algorithms. In: Proceedings of the Twenty-Ninth Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 2801–2820. SIAM (2018)
5. Christofides, N.: Worst-case analysis of a new heuristic for the travelling salesman problem. Technical report, Carnegie-Mellon University Pittsburgh, PA, Management Sciences Research Group (1976)
Cited by
8 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献