Complexity of the traveling tournament problem

Authors:
Clemens Thielen;Stephan Westphal
Affiliations:
-;-
Venue:
Theoretical Computer Science
Year:
2011

Citing 5
Cited 2

Computers and Intractability: A Guide to the Theory of NP-Completeness

Computers and Intractability: A Guide to the Theory of NP-Completeness
The Traveling Tournament Problem Description and Benchmarks

CP '01 Proceedings of the 7th International Conference on Principles and Practice of Constraint Programming
A simulated annealing approach to the traveling tournament problem

Journal of Scheduling
A method for combining complementary techniques for document image segmentation

Pattern Recognition
An Improved Approximation Algorithm for the Traveling Tournament Problem

ISAAC '09 Proceedings of the 20th International Symposium on Algorithms and Computation

Scheduling bipartite tournaments to minimize total travel distance

Journal of Artificial Intelligence Research
Generating approximate solutions to the traveling tournament problem using a linear distance relaxation

Journal of Artificial Intelligence Research

Quantified Score

Hi-index	5.23

Visualization

Abstract

We consider the complexity of the traveling tournament problem, which is a well-known benchmark problem in tournament timetabling. The problem was supposed to be computationally hard ever since its proposal in 2001. Recently, the first NP-completeness proof has been given for the variant of the problem were no constraints on the number of consecutive home games or away games of a team are considered. The complexity of the original traveling tournament problem including these constraints, however, is still open. In this paper, we show that this variant of the problem is strongly NP-complete when the upper bound on the maximal number of consecutive away games is set to 3.