On patching algorithms for random asymmetric travelling salesman problems

Let the arc-lengthsLij of a complete digraph onn vertices be independent uniform [0, 1] random variables. We consider the patching algorithm of Karp and Steele for the travelling salesman problem on such a digraph and give modifications which tighten the expected error. We extend these ideas to thek-person travelling salesman problem and also consider the case where cities can be visited more than once.