@book{64f3e779fa9940538147146a7592213d,

title = "Sports tournaments, home-away assignments, and the break minimization problem",

abstract = "We consider the break minimization problem for fixing home-away assignments in round-robin sports tournaments. First, we show that for an opponent schedule with $n$ teams and $n-1$ rounds, there always exists a home-away assignment with at most $\frac14 n(n-2)$ breaks. Secondly, for infinitely many $n$, we construct opponent schedules for which at least $\frac16 n(n-1)$ breaks are necessary. Finally, we prove that break minimization for $n$ teams and a partial opponent schedule with $r$ rounds is an NP-hard problem for $r\ge3$. This is in strong contrast to the case of $r=2$ rounds, which can be scheduled (in polynomial time) without any breaks.",

keywords = "MSC-90B35, METIS-225439, IR-65944, EWI-3580",

author = "Post, {Gerhard F.} and Gerhard Woeginger",

note = "Imported from MEMORANDA",

year = "2005",

language = "Undefined",

isbn = "0169-2690",

series = "Memorandum Afdeling TW",

publisher = "University of Twente",

number = "1760",

address = "Netherlands",

}