Unconstrained Traveling Tournament Problem is APX-complete

Download PDF
Open Webpage

Salomon Bendayan, Joseph Cheriyan, Kevin K. H. Cheung

Published: 2022, Last Modified: 07 Nov 2025CoRR 2022EveryoneRevisionsBibTeXCC BY-SA 4.0
Abstract: We show that the Unconstrained Traveling Tournament Problem (UTTP) is APX-complete by presenting an L-reduction from a version of metric (1,2)-TSP to UTTP. Keywords: Traveling Tournament Problem, APX-complete, Approximation algorithms, Traveling Salesman Problem