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:20240310T070000
END:DAYLIGHT
BEGIN:STANDARD
TZNAME:EST
TZOFFSETFROM:-0400
TZOFFSETTO:-0500
DTSTART:20231105T060000
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
UID:69dc53349fea6
DTSTART;TZID=America/Toronto:20240327T120000
SEQUENCE:0
TRANSP:TRANSPARENT
DTEND;TZID=America/Toronto:20240327T130000
URL:https://uwaterloo.ca/computer-science/events/seminar-algorithms-and-com
 plexity-stochastic-minimum-vertex-cover-with-few-queries-a-32-approximatio
 n
LOCATION:DC - William G. Davis Computer Research Centre 200 University Aven
 ue West Hybrid: DC 3317 | Online seminar Waterloo ON N2L 3G1 Canada
SUMMARY:Seminar • Algorithms and Complexity • Stochastic Minimum Vertex
 \nCover with Few Queries: A 3/2-approximation
CLASS:PUBLIC
DESCRIPTION:PLEASE NOTE: THIS SEMINAR WILL TAKE PLACE IN DC 3317 AND ONLINE
 .\n\nMAHSA DERAKHSHAN\, ASSISTANT PROFESSOR\n_Khoury College of Computer S
 ciences\, Northeastern University_\n\nIn this talk\, we discuss the stocha
 stic vertex cover problem. In this\nproblem\, G is an arbitrary known grap
 h\, and G* is an unknown random\nsubgraph of G containing each of its edge
 s independently with a known\nprobability p. Edges of G* can only be verif
 ied using edge queries.\nThe goal in this problem is to find a minimum ver
 tex cover of G* using\na small number of queries.
DTSTAMP:20260413T022140Z
END:VEVENT
END:VCALENDAR