An O(log <i>n</i>) Approximation Ratio for the Asymmetric Traveling Salesman Path Problem.

Chandra Chekuri Martin Pál An O(log <i>n</i>) Approximation Ratio for the Asymmetric Traveling Salesman Path Problem. 197-209 2007 3 Theory of Computing 1 http://dx.doi.org/10.4086/toc.2007.v003a010 db/journals/toc/toc3.html#ChekuriP07