32–approximation algorithm for two variants of a 2-depot Hamiltonian path problem

We consider two variants of a 2-depot Hamiltonian path problem and show that they have an algorithm with an approximation ratio of 32 if the costs are symmetric and satisfy the triangle inequality. This improves the 2-approximation algorithm already available for the problem.