Approximation algorithms for \(\mathrm{TTP(2)}\)

DOI10.1007/s00186-012-0387-4zbMath1258.49049OpenAlexW2051443526WikidataQ57851400 ScholiaQ57851400MaRDI QIDQ1935936

Stephan Westphal, Clemens Thielen

Publication date: 20 February 2013

Published in: Mathematical Methods of Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00186-012-0387-4

zbMATH Keywords

timetablingapproximation algorithmssports schedulingtraveling tournament problem

Mathematics Subject Classification ID

Related Items (1)

A further improvement on approximating TTP-2

Cites Work

• Unnamed Item
• 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
• An approximation algorithm for the traveling tournament problem
• Round robin scheduling -- a survey
• Scheduling in Sports

This page was built for publication: Approximation algorithms for \(\mathrm{TTP(2)}\)