http://theoryofcomputing.org ISSN 1557-2862
comment added
Volume 3, Article 10 (pages 197-209)
An O(log
n
) Approximation Ratio for the Asymmetric Traveling Salesman Path Problem
by
Chandra Chekuri
and
Martin Pál
■