An Improved Approximation Algorithm for the Traveling Tournament Problem

DOI10.1007/978-3-642-10631-6_69zbMath1273.68414OpenAlexW1826355535MaRDI QIDQ3652254

Ryuhei Miyashiro, Daisuke Yamaguchi, Shinji Imahori, Tomomi Matsui

Publication date: 17 December 2009

Published in: Algorithms and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-10631-6_69

zbMATH Keywords

schedulingapproximation algorithmlower boundtimetablingtraveling tournament problem

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Approximation algorithms (68W25)

Related Items (6)

Sports scheduling and other topics in sports analytics: a survey with special reference to Latin America ⋮ A combined local search and integer programming approach to the traveling tournament problem ⋮ Complexity of the traveling tournament problem ⋮ Round robin tournaments and three index assignments ⋮ A 5.875-approximation for the traveling tournament problem ⋮ On the complexity of the traveling umpire problem

This page was built for publication: An Improved Approximation Algorithm for the Traveling Tournament Problem