Approximation algorithms for the directed k-tour and k-stroll problems
On the worst-case performance of some algorithms for the asymmetric traveling salesman problem