Tight bounds for break minimization

Share/Save/Bookmark

Brouwer, Andries E. and Post, Gerhard and Woeginger, Gerhard J. (2007) Tight bounds for break minimization. [Report]

open access
[img]
Preview
PDF
193kB
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.
Item Type:Report
Faculty:
Electrical Engineering, Mathematics and Computer Science (EEMCS)
Research Group:
Link to this item:http://purl.utwente.nl/publications/67076
Publisher URL:http://www.math.utwente.nl/publications
Export this item as:BibTeX
EndNote
HTML Citation
Reference Manager

 

Repository Staff Only: item control page

Metis ID: 241596