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:69d323f3c52cc
DTSTART;TZID=America/Toronto:20191004T130000
SEQUENCE:0
TRANSP:TRANSPARENT
DTEND;TZID=America/Toronto:20191004T130000
URL:https://uwaterloo.ca/combinatorics-and-optimization/events/combinatoria
 l-optimization-reading-group-ishan-bansal-0
LOCATION:MC - Mathematics & Computer Building 200 University Avenue West 54
 17 Waterloo ON N2L 3G1 Canada
SUMMARY:Combinatorial Optimization Reading Group - Ishan Bansal
CLASS:PUBLIC
DESCRIPTION:TITLE: Greedy Heuristic for Maximizing Submodular Set Function
 s\n\nSpeaker:\n Ishan Bansal\n\nAffiliation:\n University of Waterloo\n\nR
 oom:\n MC 5417\n\nABSTRACT:\n\nSeveral hard combinatorial optimization pro
 blems can be posed in the\nfollowing framework: maximize a submodular func
 tion over its domain\nsubject to a cardinality constraint.
DTSTAMP:20260406T030939Z
END:VEVENT
END:VCALENDAR