[REOPENED]
"Find a TSP tour passing through at least one node in each set of nodes" was initially unclear, but the author has now clarified it into a real question (and I corrected the English): Is there a PTAS (polynomial-time approximation scheme) for this problem?
