Funder
Natural Science Foundation of Shanghai
National Natural Science Foundation of China
Subject
Computer Science Applications,Information Systems,Signal Processing,Theoretical Computer Science
Reference15 articles.
1. A heuristic with worst-case analysis for minimax routing of two traveling salesmen on a tree;Averbakh;Discrete Appl. Math.,1996
2. A framework for vehicle routing approximation schemes in trees;Becker,2019
3. A historical note on the 3/2-approximation algorithm for the metric traveling salesman problem;van Bevern;Hist. Math.,2020
4. Data mule scheduling on a path with handling time and time span constraints;Chen;Optim. Lett.,2020
5. Worst-case analysis of a new heuristic for the traveling salesman problem;Christofides,1976
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献