Complexity of Traveling Tournament Problem with Trip Length More Than Three
Computational Complexity
2021-10-07 v1 Discrete Mathematics
Abstract
The Traveling Tournament Problem is a sports-scheduling problem where the goal is to minimize the total travel distance of teams playing a double round-robin tournament. The constraint 'k' is an imposed upper bound on the number of consecutive home or away matches. It is known that TTP is NP-Hard for k=3 as well as k=infinity. In this work, the general case has been settled by proving that TTP-k is NP-Complete for any fixed k>3.
Keywords
Cite
@article{arxiv.2110.02300,
title = {Complexity of Traveling Tournament Problem with Trip Length More Than Three},
author = {Diptendu Chatterjee},
journal= {arXiv preprint arXiv:2110.02300},
year = {2021}
}
Comments
11 pages, 2 figures