UC Berkeley Research Reports Title 3/2-Approximation Algorithm for a Generalized, Multiple Depot, Hamiltonina Path Problem 3/2-Approximation Algorithm for a Generalized, Multiple Depot, Hamiltonian Path Problem 3 2 −Approximation Algorithm for a Generalized, Multiple Depot Hamiltonian Path Problem

Sivakumar Rathinam, Sengupta, Sivakumar Rathinam, Raja Sengupta, Sivakumar Rathinam, Raja Sengupta
2007 unpublished
We consider a Generalized, Multiple Depot Hamiltonian Path Problem (GMDHPP) and show that it has an algorithm with an approximation ratio of 3 2 if the costs are symmetric and satisfy the triangle inequality. This improves on the 2-approximation algorithm already available for the same.
fatcat:lvfqzn22e5gepbgrcgp44nknz4