A 1+O(1/N) approximation algorithm for TTP(2)

08/19/2021
by   Shinji Imahori, et al.
0

The traveling tournament problem is a well-known benchmark problem of the sports scheduling. We propose an approximation algorithm for the traveling tournament problem with the constraints such that both the number of consecutive home games and that of consecutive away games are at most two (called TTP(2)). The approximation ratio of the proposed algorithm is 1 + 24/n for n teams, which is the first 1 + O(1/n) approximation algorithm for TTP(2).

READ FULL TEXT

page 1

page 2

page 3

page 4

research
09/05/2023

A 5-approximation Algorithm for the Traveling Tournament Problem

The Traveling Tournament Problem (TTP-k) is a well-known benchmark probl...
research
07/03/2019

An Approximation Algorithm for a Task Allocation, Sequencing and Scheduling Problem involving a Human-Robot Team

This article presents an approximation algorithm for a task allocation, ...
research
07/14/2023

An Approximation Algorithm for Multi Allocation Hub Location Problems

The multi allocation p-hub median problem (MApHM), the multi allocation ...
research
03/27/2020

An enhanced pinwheel algorithm for the bamboo garden trimming problem

In the Bamboo Garden Trimming Problem (BGT), there is a garden populated...
research
04/24/2020

A 12/7-approximation algorithm for the discrete Bamboo Garden Trimming problem

We study the discrete Bamboo Garden Trimming problem (BGT), where we are...
research
11/07/2018

Election with Bribed Voter Uncertainty: Hardness and Approximation Algorithm

Bribery in election (or computational social choice in general) is an im...
research
08/30/2021

A Further Improvement on Approximating TTP-2

The Traveling Tournament Problem (TTP) is a hard but interesting sports ...

Please sign up or login with your details

Forgot password? Click here to reset