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:68318102e1aff
DTSTART;TZID=America/Toronto:20240327T120000
SEQUENCE:0
TRANSP:TRANSPARENT
DTEND;TZID=America/Toronto:20240327T130000
URL:/computer-science/events/seminar-algorithms-and-com
 plexity-stochastic-minimum-vertex-cover-with-few-queries-a-32-approximatio
 n
SUMMARY:Seminar • Algorithms and Complexity • Stochastic Minimum Vertex
 \nCover with Few Queries: A 3/2-approximation
CLASS:PUBLIC
DESCRIPTION:Summary \n\nPLEASE NOTE: THIS SEMINAR WILL TAKE PLACE IN DC 331
 7 AND ONLINE.\n\nMAHSA DERAKHSHAN\, ASSISTANT PROFESSOR\n_Khoury College o
 f Computer Sciences\, Northeastern University_\n\nIn this talk\, we discus
 s the stochastic vertex cover problem. In this\nproblem\, G is an arbitrar
 y known graph\, and G* is an unknown random\nsubgraph of G containing each
  of its edges independently with a known\nprobability p. Edges of G* can o
 nly be verified using edge queries.\nThe goal in this problem is to find a
  minimum vertex cover of G* using\na small number of queries.\n 
DTSTAMP:20250524T081914Z
END:VEVENT
END:VCALENDAR