Unconstrained Traveling Tournament Problem is APX-complete
Salomon Bendayan, Joseph Cheriyan, Kevin K.H. Cheung
TL;DR
This paper proves that the Unconstrained Traveling Tournament Problem (UTTP) is APX-complete by reducing from a known APX-hard problem, highlighting its computational difficulty for approximation.
Contribution
The paper establishes the APX-completeness of UTTP through an L-reduction from metric (1,2)-TSP, providing new insights into its computational complexity.
Findings
UTTP is APX-complete.
L-reduction from metric (1,2)-TSP to UTTP.
Highlights the approximation difficulty of UTTP.
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
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsScheduling and Timetabling Solutions · Artificial Intelligence in Games · Constraint Satisfaction and Optimization