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:20191103T060000
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
UID:683a64bc200e4
DTSTART;TZID=America/Toronto:20191115T130000
SEQUENCE:0
TRANSP:TRANSPARENT
DTEND;TZID=America/Toronto:20191115T130000
URL:/combinatorics-and-optimization/events/combinatoria
 l-optimization-reading-group-benjamin-moore
SUMMARY:Combinatorial Optimization Reading Group - Benjamin Moore
CLASS:PUBLIC
DESCRIPTION:Summary \n\nTITLE: A deterministic (1/2 + epsilon)-approximati
 on for submodular\nmaximizztion over a matroid\n\nSpeaker:\n Ben Moore\n\n
 Affiliation:\n University of À¶Ý®ÊÓƵ\n\nRoom:\n MC 5417\n\nABSTRACT:\n\nI
 n 1978\, it was shown that a natural greedy algorithm gives a 1/2\napproxi
 mation to submodular maximization subject to a matroid\nconstraint.\n 
DTSTAMP:20250531T020900Z
END:VEVENT
END:VCALENDAR