A 2.75-Approximation Algorithm for the Unconstrained Traveling Tournament Problem
Shinji Imahori, Tomomi Matsui, Ryuhei Miyashiro
TL;DR
This paper introduces the first constant-approximation algorithm for the unconstrained traveling tournament problem, providing solutions that satisfy specific constraints and demonstrating good practical performance through computational experiments.
Contribution
It presents the first constant-approximation algorithm for the unconstrained traveling tournament problem that meets no-repeater and mirrored constraints.
Findings
Algorithm achieves a 2.75-approximation ratio.
Solutions satisfy no-repeater and mirrored constraints.
Computational experiments show high-quality solutions.
Abstract
A 2.75-approximation algorithm is proposed for the unconstrained traveling tournament problem, which is a variant of the traveling tournament problem. For the unconstrained traveling tournament problem, this is the first proposal of an approximation algorithm with a constant approximation ratio. In addition, the proposed algorithm yields a solution that meets both the no-repeater and mirrored constraints. Computational experiments show that the algorithm generates solutions of good quality.
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.