  We present an algorithm for the asymmetric traveling salesman problem on
instances which satisfy the triangle inequality. Like several existing
algorithms, it achieves approximation ratio O(log n). Unlike previous
algorithms, it uses randomized rounding.
