A 2.75-Approximation Algorithm for the Unconstrained Traveling Tournament Problem
Data Structures and Algorithms
2016-01-15 v1
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.
Cite
@article{arxiv.1110.0620,
title = {A 2.75-Approximation Algorithm for the Unconstrained Traveling Tournament Problem},
author = {Shinji Imahori and Tomomi Matsui and Ryuhei Miyashiro},
journal= {arXiv preprint arXiv:1110.0620},
year = {2016}
}
Comments
12 pages, 1 figure