BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//Drupal iCal API//EN
X-WR-CALNAME:Events items teaser
X-WR-TIMEZONE:America/Toronto
BEGIN:VTIMEZONE
TZID:America/Toronto
X-LIC-LOCATION:America/Toronto
BEGIN:DAYLIGHT
TZNAME:EDT
TZOFFSETFROM:-0500
TZOFFSETTO:-0400
DTSTART:20260308T070000
END:DAYLIGHT
BEGIN:STANDARD
TZNAME:EST
TZOFFSETFROM:-0400
TZOFFSETTO:-0500
DTSTART:20251102T060000
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
UID:6a300f61b2718
DTSTART;TZID=America/Toronto:20260619T123000
SEQUENCE:0
TRANSP:TRANSPARENT
DTEND;TZID=America/Toronto:20260619T133000
URL:https://uwaterloo.ca/combinatorics-and-optimization/events/combopt-read
 inggroup-kevin-cheung-home-away-pattern-set
SUMMARY:CombOpt ReadingGroup - Kevin Cheung-The home-away pattern set\nfeas
 ibility problem in sports scheduling
CLASS:PUBLIC
DESCRIPTION:SPEAKER:\n\n Kevin Cheung\n\nAFFILIATION:\n Carleton university
 \n\nLOCATION:\n DC 2568\n\nABSTRACT:  In sports scheduling\, a single ro
 und-robin schedule for\n$2n$ teams consists of $2n-1$ rounds so that each
  team plays each of\nthe other $2n-1$ teams exactly once across the round
 s and that each\nteam plays exactly one game in each round. With each gam
 e played at\nthe venue of one of the two opposing teams\, a table of home
 -away\npatterns can be extracted from a single round-robin schedule so\nth
 at the $(i\,j)$-entry indicates whether team $i$ plays a home game\nor an
  away game in round $j$. \n\nThe home-away pattern set feasibility probl
 em turns the process around\nand asks: Given an arbitrarily constructed t
 able of home-away\npatterns\, is there a single round-robin schedule comp
 atible with it?\nEven though single round-robin schedules do not often ar
 ise in\npractice\, it is not uncommon in sports scheduling to first speci
 fy\nwhen teams should play home games and then decide on which opponents\
 nthey should play against. Being able to efficiently determine if a\nhome
 -away pattern set is feasible can help with quick generation of\npotentia
 l schedules.\n\nAs of today\, it is not known if the problem is NP-complet
 e. This talk\nwill focus on polynomial-time checkable necessary condition
 s for\nfeasibility and conditions under which they are also sufficient. S
 ome\npersonal reflections on the problem will conclude the talk.
DTSTAMP:20260615T144241Z
END:VEVENT
END:VCALENDAR