A further improvement on approximating TTP-2

DOI10.1007/978-3-030-89543-3_12OpenAlexW3209653295MaRDI QIDQ2695281

Mingyu Xiao, Jingyang Zhao

Publication date: 30 March 2023

Full work available at URL: https://arxiv.org/abs/2108.13060

zbMATH Keywords

approximation algorithmssports schedulingtraveling tournament problemtimetabling combinatorial optimization

Mathematics Subject Classification ID

Discrete mathematics in relation to computer science (68Rxx)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• A 2.75-approximation algorithm for the unconstrained traveling tournament problem
• A 5.875-approximation for the traveling tournament problem
• Complexity of the traveling tournament problem
• An improved approximation algorithm for the traveling tournament problem
• Scheduling in sports: an annotated bibliography
• A simulated annealing approach to the traveling tournament problem
• Some models of graphs for scheduling sports competitions
• Complexity of the unconstrained traveling tournament problem
• An approximation algorithm for the traveling tournament problem
• Approximation algorithms for \(\mathrm{TTP(2)}\)
• Round robin scheduling -- a survey
• A simulated annealing and hill-climbing algorithm for the traveling tournament problem
• An Approximation Algorithm for the Bipartite Traveling Tournament Problem

This page was built for publication: A further improvement on approximating TTP-2