We study the approximation complexity of certain kinetic variants of the Traveling Salesman Problem where we consider instances in which each point moves with a xed constant speed in a xed direction. We prove the following results. 1. If the points all move with the same velocity, then there is a PTAS for the Kinetic TSP. 2. The Kinetic TSP cannot be approximated better than by a factor of two ...
