A \(\frac{5}{3}\)-approximation algorithm for the clusterd traveling salesman tour and path problems
ordered cluster traveling salesman problem
scientific article; zbMATH DE number 1347065