Approximating the Traveling Tournament Problem with Maximum Tour Length 2

DOI10.1007/978-3-642-17514-5_26zbMath1311.90128OpenAlexW1488374097MaRDI QIDQ3060783

Clemens Thielen, Stephan Westphal

Publication date: 9 December 2010

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

Full work available at URL: https://doi.org/10.1007/978-3-642-17514-5_26

zbMATH Keywords

approximation algorithmtimetablingtraveling tournament problem

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27) Approximation algorithms (68W25)

Related Items (1)

A 2.75-approximation algorithm for the unconstrained traveling tournament problem

This page was built for publication: Approximating the Traveling Tournament Problem with Maximum Tour Length 2