A fundamental variant of the classical traveling salesman problem (TSP) is the so-called multiple TSP (mTSP), where a set of salesmen jointly visit all cities from a set of cities. The mTSP models many important real-life applications, in particular for vehicle routing problems. In our paper titled Many-visits multiple traveling salesman problems that was recently accepted to Omega, we consider a further generalization of mTSP, the many-visits mTSP, where each city has a request of how many times it should be visited by the salesmen. We provide multiple efficient approximation algorithms for important variants, which are guaranteed to quickly compute high-quality solutions for all problem instances.