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:6832e99938f83
DTSTART;TZID=America/Toronto:20220729T130000
SEQUENCE:0
TRANSP:TRANSPARENT
DTEND;TZID=America/Toronto:20220729T130000
URL:/combinatorics-and-optimization/events/combinatoria
 l-optimization-reading-group-rian-neogi
SUMMARY:Combinatorial Optimization Reading Group - Rian Neogi
CLASS:PUBLIC
DESCRIPTION:Summary \n\nTITLE: Stochastic Load Balancing on Unrelated Machi
 nes\n\nSpeaker:\n Rian Neogi\n\nAffiliation:\n University of À¶Ý®ÊÓƵ\n\nL
 ocation:\n MC 6029 or contact Rian Neogi for Zoom link\n\nABSTRACT: We wil
 l take a look at the stochastic load balancing\nproblem. The goal is to as
 sign tasks to machines\, so that the maximum\namount of time taken by any 
 machine to complete all its assigned tasks\nis minimized. The stochastic t
 wist to this problem is that now the\ntime required to complete each task 
 is a random variable sampled from\nsome known distribution. For the stocha
 stic version\, we need to\nminimize the maximum time taken by any machine 
 in expectation. We will\nlook at a constant factor approximation algorithm
  for this problem\nthat appeared in a recent paper by Gupta\, Kumar\, Naga
 rajan and Shen.\n 
DTSTAMP:20250525T095745Z
END:VEVENT
END:VCALENDAR