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:20240310T070000
END:DAYLIGHT
BEGIN:STANDARD
TZNAME:EST
TZOFFSETFROM:-0400
TZOFFSETTO:-0500
DTSTART:20231105T060000
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
UID:69d12e2023628
DTSTART;TZID=America/Toronto:20240322T120000
SEQUENCE:0
TRANSP:TRANSPARENT
DTEND;TZID=America/Toronto:20240322T133000
URL:https://uwaterloo.ca/combinatorics-and-optimization/events/co-reading-g
 roup-vihan-shah
SUMMARY:C&O Reading Group - Vihan Shah
CLASS:PUBLIC
DESCRIPTION:TITLE: An Optimal Algorithm for Online Bipartite Matching \n\n
 SPEAKER:\n Vihan Shah\n\nAFFILIATION:\n University of Waterloo\n\nLOCATION
 :\n MC 6029\n\nABSTRACT: We consider the bipartite matching problem in the
  online\nsetting where vertices on the left arrive in an arbitrary order 
 along\nwith all their edges. Once a vertex arrives\, the algorithm has to\
 nmatch the vertex (or can choose to not match it) and this decision\ncanno
 t be changed later. Karp\, Vazirani\, and Vazirani give an\nalgorithm for
  this problem with a competitive ratio of 1-1/e and\nalso show it is op
 timal.
DTSTAMP:20260404T152832Z
END:VEVENT
END:VCALENDAR