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:20220313T070000
END:DAYLIGHT
BEGIN:STANDARD
TZNAME:EST
TZOFFSETFROM:-0400
TZOFFSETTO:-0500
DTSTART:20221106T060000
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
UID:69e3fbf5c8615
DTSTART;TZID=America/Toronto:20221125T120000
SEQUENCE:0
TRANSP:TRANSPARENT
DTEND;TZID=America/Toronto:20221125T120000
URL:https://uwaterloo.ca/combinatorics-and-optimization/events/combinatoria
 l-optimization-reading-group-ian-dehaan
SUMMARY:Combinatorial Optimization Reading Group - Ian DeHaan
CLASS:PUBLIC
DESCRIPTION:Title: Greedy algorithm for stochastic matching is a 2-approxi
 matio\n\nSpeaker:\n Ian DeHaan\n\nAffiliation:\n University of Waterloo\n\
 nLocation:\n MC 6029 or contact Rian Neogi for Zoom link\n\nAbstract: We
  will discuss the greedy algorithm for the stochastic\nmatching problem. I
 n this problem\, we are given an undirected graph\nwhere each edge is assi
 gned a probability p_e in [0\, 1] and each\nvertex is assigned a patience 
 t_v in Z+. We begin each step by probing\nan edge e which is not adjacent 
 to any edges in our matching. The\nprobe will succeed with probability p_e
 \, and if it does\, we add e to\nour matching. Otherwise\, we may not prob
 e e again. We also may not\nprobe edges adjacent to a vertex v more than t
 _v times. The goal is to\nmaximize the number of edges we add to our match
 ing. 
DTSTAMP:20260418T214733Z
END:VEVENT
END:VCALENDAR