2025
Improved Approximation Algorithms for Clustered TSP and Subgroup Planning
AAAI 2025technical
In the Clustered TSP (CTSP), we are given an edge-weighted graph satisfying the triangle inequality property, and a family of pairwise disjoint vertex groups. The goal is to find a minimum weight tour that includes all vertices, ensuring that the vertices within each group appear consecutively on t…