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:20211107T060000
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
UID:69e5110a42755
DTSTART;TZID=America/Toronto:20220729T130000
SEQUENCE:0
TRANSP:TRANSPARENT
DTEND;TZID=America/Toronto:20220729T130000
URL:https://uwaterloo.ca/combinatorics-and-optimization/events/combinatoria
 l-optimization-reading-group-rian-neogi
SUMMARY:Combinatorial Optimization Reading Group - Rian Neogi
CLASS:PUBLIC
DESCRIPTION:TITLE: Stochastic Load Balancing on Unrelated Machines\n\nSpeak
 er:\n Rian Neogi\n\nAffiliation:\n University of Waterloo\n\nLocation:\n M
 C 6029 or contact Rian Neogi for Zoom link\n\nABSTRACT: We will take a loo
 k at the stochastic load balancing\nproblem. The goal is to assign tasks t
 o machines\, so that the maximum\namount of time taken by any machine to c
 omplete all its assigned tasks\nis minimized. The stochastic twist to this
  problem is that now the\ntime required to complete each task is a random 
 variable sampled from\nsome known distribution. For the stochastic version
 \, we need to\nminimize the maximum time taken by any machine in expectati
 on. We will\nlook at a constant factor approximation algorithm for this pr
 oblem\nthat appeared in a recent paper by Gupta\, Kumar\, Nagarajan and Sh
 en.
DTSTAMP:20260419T172946Z
END:VEVENT
END:VCALENDAR