A faster 2-approximation algorithm for the minmax p -traveling salesmen problem on a tree

Discrete Applied Mathematics

Volumn 140, Issue 1-3, 2004, Pages 103-114

  Nagamochi, Hiroshi ^a   Okada, Kohei ^b  

^a TOYOHASHI UNIVERSITY OF TECHNOLOGY   (Japan)

^b PANASONIC CORPORATION   (Japan)

Author keywords

Approximation algorithm; Graph partition; NP hard; Traveling salesman problem; Tree; Vehicle routing

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; ARTIFICIAL INTELLIGENCE; COMPUTATIONAL COMPLEXITY; OPTIMIZATION; POLYNOMIALS; PROBLEM SOLVING; TREES (MATHEMATICS);

APPROXIMATION ALGORITHM; GRAPH PARTITION; NP-HARD; VEHICLE ROUTING;

TRAVELING SALESMAN PROBLEM;

EID: 2642553133     PISSN: 0166218X     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.dam.2003.06.001     Document Type: Article

References (14)

1. Asano T., Katoh N., Kawashima K. A new approximation algorithm for the capacitated vehicle routing problem on a tree. J. Combin. Optim. 5:2001;213-231.
2. Averbakh I., Berman O. Sales-delivery man problems on treelike networks. Networks. 25:1995;45-58.
3. Averbakh I., Berman O. A heuristic with worst-case analysis for minmax routing of two traveling salesmen on a tree. Discrete Appl. Math. 68:1996;17-32.
4. Averbakh I., Berman O. (p-1)/(p+1) -approximate algorithm for p -traveling salesmen problems on a tree with minmax objective Discrete Appl. Math. 75:1997;201-216.
5. Becker R., Perl Y. The shifting algorithm technique for the partitioning of trees. Discrete Appl. Math. 62:1995;15-34.
6. Bruno J., Downey P. Complexity of task sequencing with deadlines, set-up times and changeover costs. SIAM J. Comput. 7:1978;393-581.
7. J. Desrosiers, Y. Dumas, M.M. Solomon, F. Soumis, Time constrained routing and scheduling, in: M.O. Ball, T.L. Magnanti. C.L. Monma, G.L. Nemhauser (Eds.), Handbooks in Operations Research and Management Science Volume 8: Network Routing, North-Holland, Amsterdam, 1995, pp. 35-139.
8. Y. Karuno, H. Nagamochi, A 2-approximation algorithm for the multi-vehicle scheduling on a path with release and handling times, in: Proc. ESA'01, Lecture Notes in Computer Science, Vol. 2161, Springer, Berlin, 2001, pp. 218-229.
9. Y. Karuno, H. Nagamochi, A polynomial time approximation scheme for the multi-vehicle scheduling on a path with release and handling times, in: Proc. ISAAC'01, Lecture Notes in Computer Science, Vol. 2223, Springer, Berlin, 2001, pp. 36-47.
10. Karuno Y., Nagamochi H., Ibaraki T. Vehicle scheduling on a tree to minimize maximum lateness. J. Oper. Res. Soc. Japan. 39:1996;345-355.
11. Karuno Y., Nagamochi H., Ibaraki T. Vehicle scheduling on a tree with release and handling times. Ann. Oper. Res. 69:1997;193-207.
12. Nagamochi H., Mochizuki K., Ibaraki T. Complexity of the single vehicle scheduling problem on graphs. Inform. Systems Oper. Res. 35:1997;256-276.
13. Psaraftis H., Solomon M., Magnanti T., Kim T. Routing and scheduling on a shoreline with release times. Manage. Sci. 36:1990;212-223.
14. Tsitsiklis J.N. Special cases of traveling salesman and repairman problems with time windows. Networks. 22:1992;263-282.