Author:
Karuno Yoshiyuki,Nagamochi Hiroshi
Subject
General Computer Science,Theoretical Computer Science
Reference22 articles.
1. J.E. Augustine, S.S. Seiden, Linear time approximation schemes for vehicle scheduling, in: M. Penttonen, E. Meineche Schmidt (Eds.), Lecture Notes in Computer Science, Vol. 2368, Algorithm Theory—SWAT 2002, Springer, Berlin, 2002, pp. 30–39.
2. Complexity and Approximation: Combinatorial Optimization Problems and Their Approximability Properties;Ausiello,1999
3. Routing and location-routing p-delivery men problems on a path;Averbakh;Transportation Sci.,1994
4. Sales-delivery man problems on treelike networks;Averbakh;Networks,1995
5. A heuristic with worst-case analysis for minmax routing of two traveling salesmen on a tree;Averbakh;Discrete Appl. Math.,1996
Cited by
18 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献