A 2.75-Approximation Algorithm for the Unconstrained Traveling Tournament Problem

Details A 2.75-Approximation Algorithm for the Unconstrained Traveling Tournament Problem A 2.75-Approximation Algorithm for the Unconstrained Traveling Tournament Problem

2011-10-04

arxiv.org/abs/1110.0620v1

Computer Science

Data Structures and Algorithms

12 pages, 1 figure

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

A 2.75-Approximation Algorithm for the Unconstrained Traveling Tournament Problem does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with A 2.75-Approximation Algorithm for the Unconstrained Traveling Tournament Problem, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and A 2.75-Approximation Algorithm for the Unconstrained Traveling Tournament Problem will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-267895