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:69d12dd96e2d1
DTSTART;TZID=America/Toronto:20240216T120000
SEQUENCE:0
TRANSP:TRANSPARENT
DTEND;TZID=America/Toronto:20240216T130000
URL:https://uwaterloo.ca/combinatorics-and-optimization/events/co-reading-g
 roup-david-aleman
SUMMARY:C&O Reading Group - David Aleman
CLASS:PUBLIC
DESCRIPTION:TITLE: A O(log log (rank) ) - competitive algorithm for the mat
 roid\nsecretary problem\n\nSPEAKER:\n David Aleman\n\nAFFILIATION:\n Unive
 rsity of Waterloo\n\nLOCATION:\n MC 6029\n\nABSTRACT: In the Matroid Secre
 tary problem the weighted elements of a\nmatroid arrive one by one in a un
 iformly random order where an online\nalgorithm observes the value of the 
 element and must make an\nirrevocable decision of whether or not to includ
 e the element in its\nsolution before the arrival of the next element. The
  goal is to\nmaximize the total value of the chosen elements under the con
 dition\nthat they must constitute an independent set. Other than knowing t
 he\ncardinality of the ground set and having access to an independence\nor
 acle\, the algorithm has no further information about the matroid.
DTSTAMP:20260404T152721Z
END:VEVENT
END:VCALENDAR