An improved approximation algorithm for the traveling tournament problem

DOI10.1007/s00453-011-9579-1zbMath1229.90173OpenAlexW1979381633MaRDI QIDQ652542

Ryuhei Miyashiro, Tomomi Matsui, Shinji Imahori, Daisuke Yamaguchi

Publication date: 14 December 2011

Published in: Algorithmica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00453-011-9579-1

zbMATH Keywords

schedulingapproximation algorithmlower boundtimetablingtraveling tournament problem

Mathematics Subject Classification ID

Combinatorial optimization (90C27) Approximation algorithms (68W25)

Related Items (3)

Approximation algorithms for \(\mathrm{TTP(2)}\) ⋮ A further improvement on approximating TTP-2 ⋮ A 2.75-approximation algorithm for the unconstrained traveling tournament problem

Cites Work

• A Benders approach for the constrained minimum break problem
• An approximation algorithm for the traveling tournament problem
• Round robin scheduling -- a survey
• Unnamed Item

This page was built for publication: An improved approximation algorithm for the traveling tournament problem