Document

# Improved Approximation Algorithms for the Traveling Tournament Problem

## File

LIPIcs.MFCS.2022.83.pdf
• Filesize: 0.74 MB
• 15 pages

## Cite As

Jingyang Zhao, Mingyu Xiao, and Chao Xu. Improved Approximation Algorithms for the Traveling Tournament Problem. In 47th International Symposium on Mathematical Foundations of Computer Science (MFCS 2022). Leibniz International Proceedings in Informatics (LIPIcs), Volume 241, pp. 83:1-83:15, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2022)
https://doi.org/10.4230/LIPIcs.MFCS.2022.83

## Abstract

The Traveling Tournament Problem (TTP) is a well-known benchmark problem in the field of tournament timetabling, which asks us to design a double round-robin schedule such that each pair of teams plays one game in each other’s home venue, minimizing the total distance traveled by all n teams (n is even). TTP-k is the problem with one more constraint that each team can have at most k consecutive home games or away games. The case where k = 3, TTP-3, is one of the most investigated cases. In this paper, we improve the approximation ratio of TTP-3 from (1.667+ε) to (1.598+ε), for any ε > 0. Previous schedules were constructed based on a Hamiltonian cycle of the graph. We propose a novel construction based on triangle packing. Then, by combining our triangle packing schedule with the Hamiltonian cycle schedule, we obtain the improved approximation ratio. The idea of our construction can also be extended to k ≥ 4. We demonstrate that the approximation ratio of TTP-4 can be improved from (1.750+ε) to (1.700+ε) by the same method. As an additional product, we also improve the approximation ratio of LDTTP-3 (TTP-3 where all teams are allocated on a straight line) from 4/3 to (6/5+ε).

## Subject Classification

##### ACM Subject Classification
• Theory of computation → Approximation algorithms analysis
• Theory of computation → Scheduling algorithms
##### Keywords
• Sports scheduling
• Traveling Tournament Problem
• Approximation algorithm

## Metrics

• Access Statistics
• Total Accesses (updated on a weekly basis)
0

## References

1. Aris Anagnostopoulos, Laurent Michel, Pascal Van Hentenryck, and Yannis Vergados. A simulated annealing approach to the traveling tournament problem. Journal of Scheduling, 9(2):177-193, 2006.
2. Rishiraj Bhattacharyya. Complexity of the unconstrained traveling tournament problem. Operations Research Letters, 44(5):649-654, 2016.
3. David Van Bulck, Dries R. Goossens, Jörn Schönberger, and Mario Guajardo. Robinx: A three-field classification and unified data format for round-robin sports timetabling. Eur. J. Oper. Res., 280(2):568-580, 2020.
4. Robert Thomas Campbell and Der-San Chen. A minimum distance basketball scheduling problem. Management science in sports, 4:15-26, 1976.
5. Diptendu Chatterjee. Complexity of traveling tournament problem with trip length more than three. CoRR, abs/2110.02300, 2021. URL: http://arxiv.org/abs/2110.02300.
6. Diptendu Chatterjee and Bimal Kumar Roy. An improved scheduling algorithm for traveling tournament problem with maximum trip length two. In ATMOS 2021, volume 96, pages 16:1-16:15, 2021.
7. Nicos Christofides. Worst-case analysis of a new heuristic for the travelling salesman problem. Technical report, Carnegie-Mellon Univ Pittsburgh Pa Management Sciences Research Group, 1976.
8. Dominique De Werra. Scheduling in sports. Studies on graphs and discrete programming, 11:381-395, 1981.
9. Luca Di Gaspero and Andrea Schaerf. A composite-neighborhood tabu search approach to the traveling tournament problem. Journal of Heuristics, 13(2):189-207, 2007.
10. Kelly Easton, George Nemhauser, and Michael Trick. The traveling tournament problem: description and benchmarks. In 7th International Conference on Principles and Practice of Constraint Programming, pages 580-584, 2001.
11. Kelly Easton, George Nemhauser, and Michael Trick. Solving the travelling tournament problem: a combined integer programming and constraint programming approach. In 4th International Conference of Practice and Theory of Automated Timetabling IV, pages 100-109, 2003.
12. Michel X. Goemans and David P. Williamson. A general approximation technique for constrained forest problems. SIAM J. Comput., 24(2):296-317, 1995.
13. Marc Goerigk, Richard Hoshino, Ken Kawarabayashi, and Stephan Westphal. Solving the traveling tournament problem by packing three-vertex paths. In Twenty-Eighth AAAI Conference on Artificial Intelligence, pages 2271-2277, 2014.
14. Marc Goerigk and Stephan Westphal. A combined local search and integer programming approach to the traveling tournament problem. Ann. Oper. Res., 239(1):343-354, 2016.
15. Richard Hoshino and Ken-ichi Kawarabayashi. Generating approximate solutions to the TTP using a linear distance relaxation. J. Artif. Intell. Res., 45:257-286, 2012.
16. Richard Hoshino and Ken-ichi Kawarabayashi. An approximation algorithm for the bipartite traveling tournament problem. Mathematics of Operations Research, 38(4):720-728, 2013.
17. Shinji Imahori. A 1+O(1/N) approximation algorithm for TTP(2). CoRR, abs/2108.08444, 2021. URL: http://arxiv.org/abs/2108.08444.
18. Shinji Imahori, Tomomi Matsui, and Ryuhei Miyashiro. A 2.75-approximation algorithm for the unconstrained traveling tournament problem. Annals of Operations Research, 218(1):237-247, 2014.
19. Thomas P Kirkman. On a problem in combinations. Cambridge and Dublin Mathematical Journal, 2:191-204, 1847.
20. Andrew Lim, Brian Rodrigues, and Xingwen Zhang. A simulated annealing and hill-climbing algorithm for the traveling tournament problem. European Journal of Operational Research, 174(3):1459-1478, 2006.
21. Ryuhei Miyashiro, Tomomi Matsui, and Shinji Imahori. An approximation algorithm for the traveling tournament problem. Annals of Operations Research, 194(1):317-324, 2012.
22. Jérôme Monnot and Sophie Toulouse. Approximation results for the weighted p_4 partition problem. J. Discrete Algorithms, 6(2):299-312, 2008.
23. Anatolii Ivanovich Serdyukov. Some extremal bypasses in graphs. Upravlyaemye Sistemy, 17:76-79, 1978.
24. Clemens Thielen and Stephan Westphal. Complexity of the traveling tournament problem. Theoretical Computer Science, 412(4):345-351, 2011.
25. Clemens Thielen and Stephan Westphal. Approximation algorithms for TTP(2). Mathematical Methods of Operations Research, 76(1):1-20, 2012.
26. Michael Trick. Challenge traveling tournament instances. Accessed: 2022-4-01, 2022.
27. Stephan Westphal and Karl Noparlik. A 5.875-approximation for the traveling tournament problem. Annals of Operations Research, 218(1):347-360, 2014.
28. Mingyu Xiao and Shaowei Kou. An improved approximation algorithm for the traveling tournament problem with maximum trip length two. In MFCS 2016, volume 58, pages 89:1-89:14, 2016.
29. Daisuke Yamaguchi, Shinji Imahori, Ryuhei Miyashiro, and Tomomi Matsui. An improved approximation algorithm for the traveling tournament problem. Algorithmica, 61(4):1077-1091, 2011.
30. Jingyang Zhao and Mingyu Xiao. A further improvement on approximating TTP-2. In COCOON 2021, volume 13025 of Lecture Notes in Computer Science, pages 137-149. Springer, 2021.
31. Jingyang Zhao and Mingyu Xiao. The traveling tournament problem with maximum tour length two: A practical algorithm with an improved approximation bound. In IJCAI 2021, pages 4206-4212, 2021.
X

Feedback for Dagstuhl Publishing