Unconstrained Traveling Tournament Problem is APX-complete
Data Structures and Algorithms
2022-12-20 v1 Combinatorics
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
Keywords
Cite
@article{arxiv.2212.09165,
title = {Unconstrained Traveling Tournament Problem is APX-complete},
author = {Salomon Bendayan and Joseph Cheriyan and Kevin K. H. Cheung},
journal= {arXiv preprint arXiv:2212.09165},
year = {2022}
}
Comments
The results of this paper appear in preliminary form in the thesis of the first author "The Traveling Tournament Problem'', Master's thesis, University of Waterloo, 2022. See: https://uwspace.uwaterloo.ca/handle/10012/18553