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:20210314T070000
END:DAYLIGHT
BEGIN:STANDARD
TZNAME:EST
TZOFFSETFROM:-0400
TZOFFSETTO:-0500
DTSTART:20201101T060000
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
UID:69cec454ec3dc
DTSTART;TZID=America/Toronto:20210917T153000
SEQUENCE:0
TRANSP:TRANSPARENT
DTEND;TZID=America/Toronto:20210917T153000
URL:https://uwaterloo.ca/combinatorics-and-optimization/events/tutte-colloq
 uium-alex-pothen
SUMMARY:Tutte Colloquium - Alex Pothen
CLASS:PUBLIC
DESCRIPTION:TITLE: Approximation Algorithms for Matchings in Big Graphs\n\
 nSpeaker:\n Alex Pothen\n\nAffiliation:\n Purdue University\n\nZoom:\n Ple
 ase email Emma Watson\n\nABSTRACT:\n\nMatchings in graphs are classical p
 roblems in combinatorial\noptimization and computer science\, significant 
 due to their\ntheoretical importance and relevance to applications. Polyno
 mial time\nalgorithms for several variant matching problems with linear ob
 jective\nfunctions have been known for fifty years\, with important\ncontr
 ibutions from Tutte\, Edmonds\, Cunningham\, and Pulleyblank (all\nwith Wa
 terloo associations)\, and they are discussed in the textbook\nliterature.
DTSTAMP:20260402T193236Z
END:VEVENT
END:VCALENDAR