Title of article
Tight bounds for break minimization in tournament scheduling
Author/Authors
Brouwer، نويسنده , , Andries E. and Post، نويسنده , , Gerhard F. and Woeginger، نويسنده , , Gerhard J.، نويسنده ,
Issue Information
روزنامه با شماره پیاپی سال 2008
Pages
4
From page
1065
To page
1068
Abstract
We consider round-robin sports tournaments with n teams and n − 1 rounds. We construct an infinite family of opponent schedules for which every home-away assignment induces at least 1 4 n ( n − 2 ) breaks. This construction establishes a matching lower bound for a corresponding upper bound from the literature.
Keywords
Latin squares , Sports scheduling , Sports tournament , Break Minimization
Journal title
Journal of Combinatorial Theory Series A
Serial Year
2008
Journal title
Journal of Combinatorial Theory Series A
Record number
1531319
Link To Document