Tight bounds for break minimization

Andries E. Brouwer, Gerhard F. Post, Gerhard Woeginger

Research output: Book/ReportReportProfessional

38 Downloads (Pure)

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.
Original languageUndefined
Place of PublicationEnschede
PublisherUniversity of Twente
Number of pages5
Publication statusPublished - May 2007

Publication series

NameMemorandum / Department of Applied Mathematics
PublisherDepartment of Applied Mathematics, University of Twente
No.WP07-01/1836
ISSN (Print)1874-4850
ISSN (Electronic)1874-4850

Keywords

  • IR-67076
  • sports tournament
  • EWI-9712
  • break minimization
  • Sports scheduling
  • Latin squares
  • METIS-241596

Cite this