Approximation Algorithms for Sequencing Problems
On the worst-case performance of some algorithms for the asymmetric traveling salesman problem