An extension of Christofides heuristic to the k-person travelling salesman problem
- 31 May 1983
- journal article
- Published by Elsevier in Discrete Applied Mathematics
- Vol. 6 (1) , 79-83
- https://doi.org/10.1016/0166-218x(83)90102-6
Abstract
No abstract availableKeywords
This publication has 4 references indexed in Scilit:
- Approximation Algorithms for Some Postman ProblemsJournal of the ACM, 1979
- Tight bounds for christofides' traveling salesman heuristicMathematical Programming, 1978
- Approximation Algorithms for Some Routing ProblemsSIAM Journal on Computing, 1978
- Approximate algorithms for the traveling salesperson problemPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1974