We provide non-trivial approximation algorithms for maximizing the
length of a traveling salesman tour. Such algorithms are of interest
for approximating the well known "super-string" problem (find a short
superstring that contains a given set of strings as substrings).
(Joint work with S. Rubinstein.)