Approximation algorithms for \(\mathrm{TTP(2)}\)
type: Item
instance of: scholarly article
title: Approximation algorithms for \(\mathrm{TTP(2)}\)
zbMATH Open document ID: 1258.49049
author: Clemens Thielen
author: Stephan Westphal
published in: Mathematical Methods of Operations Research
publication date: 2013-02-20T00:00:00Z
Mathematics Subject Classification ID: 49M30
Mathematics Subject Classification ID: 90B35
zbMATH DE Number: 6137603
zbMATH Keywords: sports scheduling
zbMATH Keywords: traveling tournament problem
zbMATH Keywords: timetabling
zbMATH Keywords: approximation algorithms
MaRDI profile type: Publication
full work available at URL: s00186-012-0387-4
OpenAlex ID: W2051443526
Wikidata QID: Q57851400
cites work: A simulated annealing approach to the traveling tournament problem
cites work: Scheduling in Sports
cites work: Q4475665
cites work: Scheduling in sports: an annotated bibliography
cites work: An approximation algorithm for the traveling tournament problem
cites work: Round robin scheduling -- a survey
cites work: Complexity of the traveling tournament problem
cites work: A 5.875-approximation for the traveling tournament problem
cites work: An improved approximation algorithm for the traveling tournament problem
DOI: 10.1007/S00186-012-0387-4
description: scientific article; zbMATH DE number 6137603