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:20230312T070000
END:DAYLIGHT
BEGIN:STANDARD
TZNAME:EST
TZOFFSETFROM:-0400
TZOFFSETTO:-0500
DTSTART:20231105T060000
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
UID:682e33f035e88
DTSTART;TZID=America/Toronto:20240301T120000
SEQUENCE:0
TRANSP:TRANSPARENT
DTEND;TZID=America/Toronto:20240301T133000
URL:/combinatorics-and-optimization/events/co-reading-g
 roup-david-aleman-0
SUMMARY:C&O Reading Group - David Aleman
CLASS:PUBLIC
DESCRIPTION:Summary \n\nTITLE: A O(log log (rank) ) - competitive algorithm
  for the matroid\nsecretary problem - Part 2\n\nSPEAKER:\n David Aleman\n\
 nAFFILIATION:\n University of À¶Ý®ÊÓƵ\n\nLOCATION:\n MC 6029\n\nABSTRACT:
  In this talk we continue to review a O(log log(rank) ) -\ncompetitive alg
 orithm for the matroid secretary problem (MSP) due to\n Feldman\, Svensso
 n and Zenklusen\, where rank denotes the rank of the\ngiven matroid. \n 
DTSTAMP:20250521T201336Z
END:VEVENT
END:VCALENDAR