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:20190310T070000
END:DAYLIGHT
BEGIN:STANDARD
TZNAME:EST
TZOFFSETFROM:-0400
TZOFFSETTO:-0500
DTSTART:20181104T060000
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
UID:69d17b4d24169
DTSTART;TZID=America/Toronto:20190712T130000
SEQUENCE:0
TRANSP:TRANSPARENT
DTEND;TZID=America/Toronto:20190712T130000
URL:https://uwaterloo.ca/combinatorics-and-optimization/events/combinatoria
 l-optimization-reading-group-madison-van-dyk-0
LOCATION:MC - Mathematics & Computer Building 200 University Avenue West 54
 79 Waterloo ON N2L 3G1 Canada
SUMMARY:Combinatorial Optimization Reading Group - Madison Van Dyk
CLASS:PUBLIC
DESCRIPTION:TITLE: A (1 + 1/_e_)-Approximation Algorithm for Maximum Stabl
 e\nMatching with One-Sided Ties and Incomplete Lists\n\nSpeaker:\n Madison
  Van Dyk\n\nAffiliation:\n University of Waterloo\n\nRoom:\n MC 5479\n\nAB
 STRACT:\n\nWe will continue the discussion of stable matching when there a
 re\nunacceptable pairs and one-sided ties. Two weeks ago\, we looked at a\
 n3/2-approximation that was purely combinatorial. 
DTSTAMP:20260404T205749Z
END:VEVENT
END:VCALENDAR