A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2018; you can also visit the original URL.
The file type is application/pdf
.
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
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