An O(log n/log log n)-approximation algorithm for the asymmetric traveling salesman problem