(p - 1)/(p + 1)-approximate algorithms for p-traveling salesmen problems on a tree with minmax objective

Discrete Applied Mathematics

Volumn 75, Issue 3, 1997, Pages 201-216

  Averbakh, Igor ^a   Berman, Oded ^b  

^a WESTERN WASHINGTON UNIVERSITY   (United States)

^b UNIVERSITY OF TORONTO   (Canada)

Author keywords

Approximate algorithms; Complexity; Traveling salesman

Indexed keywords

EID: 0141778979     PISSN: 0166218X     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0166-218X(97)89161-5     Document Type: Article

References (5)

1. I. Averbakh and O. Berman, A heuristic with worst-case analysis for minmax routing of two traveling salesmen on a tree, Discrete Appl. Math., forthcoming.
2. P.M. Franka, M. Gendreau, G. Laporte and F. Muller, The m-Travelling Salesman Problem with Minmax Objective. Centre de recherche sur les transports (Montreal), Publication #869 (1992).
3. G.N. Frederickson, M.S. Hecht and C.E. Kim. Approximation algorithms for some routing problems, SIAM J. Comput. 7, (1978) 178-193.
4. M. Garey and D. Johnson, Computers and Intractability, (Freeman, San Francisco, 1979).
5. G. Laporte, M. Desrochers and Y. Nobert, Two exact algorithms for the distance-constrained vehicle routing problem, Networks 14 (1984) 161-172.