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:69d12e1b8eb13
DTSTART;TZID=America/Toronto:20240308T120000
SEQUENCE:0
TRANSP:TRANSPARENT
DTEND;TZID=America/Toronto:20240308T133000
URL:https://uwaterloo.ca/combinatorics-and-optimization/events/co-reading-g
 roup-jacob-skitsko-0
SUMMARY:C&O Reading Group - Jacob Skitsko
CLASS:PUBLIC
DESCRIPTION:TITLE: Online Matroid Intersection: Beating Half for Random Arr
 ival\n\nSPEAKER:\n Jacob Skitsko\n\nAFFILIATION:\n University of Waterloo\
 n\nLOCATION:\n MC 6029\n\nABSTRACT: We'll take a gander at the paper _Onl
 ine Matroid\nIntersection: Beating Half for Random Arrival _by Guruganesh
  and\nSingla. We're given two matroids defined on elements of a common\ngr
 ound set\, and elements will arrive one-by-one in a uniformly random\norde
 r. Whenever an element arrives we'll need to decide to keep them\nor tell 
 them goodbye forever. The greedy algorithm gives us a\ncompetitive ratio o
 f 1/2\, but can we do better? Yes! (Slightly\, with a\nsimple randomized a
 lgorithm). We'll first take a look at the special\ncase of bipartite match
 ing. The results also extend in a natural way\nto the intersection of _k
  _matroids\, and non-bipartite matching. If\nI don't ramble too much\, we
 'll also get to (briefly) discuss a recent\nimprovement for the intersecti
 on of 2 matroids.
DTSTAMP:20260404T152827Z
END:VEVENT
END:VCALENDAR