We consider the traveling tournament problem, which is a well-known benchmark problem in tournament timetabling. The most important variant of the problem imposes restrictions on the number of consecutive home games or away games a team may have. We consider the case where at most two consecutive home games or away games are allowed. We show that the well-known independent lower bound for this case cannot be reached and present an approximation algorithm that has an approximation ratio of 3/2 + 6/n-4, where n is the number of teams in the tournament. In the case that n is divisible by 4, this approximation ratio improves to 3/2 + 5/n-1. © 2010 Springer-Verlag.
CITATION STYLE
Thielen, C., & Westphal, S. (2010). Approximating the traveling tournament problem with maximum tour length 2. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 6507 LNCS, pp. 303–314). https://doi.org/10.1007/978-3-642-17514-5_26
Mendeley helps you to discover research relevant for your work.