Asymmetric TSP

• $O(\frac{log \; n}{log \; log \; n})$ -approximation [2]
• hard to approximate within a factor less than $\frac{75}{74}$ [9]