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:69e3fd0ed4bf9
DTSTART;TZID=America/Toronto:20221111T120000
SEQUENCE:0
TRANSP:TRANSPARENT
DTEND;TZID=America/Toronto:20221111T120000
URL:https://uwaterloo.ca/combinatorics-and-optimization/events/combinatoria
 l-optimization-reading-group-sharat-ibrahimpur-4
SUMMARY:Combinatorial Optimization Reading Group - Sharat Ibrahimpur
CLASS:PUBLIC
DESCRIPTION:Title: Stochastic Minimum Norm Combinatorial Optimization\n\nSp
 eaker:\n Sharat Ibrahimpur\n\nAffiliation:\n  \n\nLocation:\n MC 6029 or 
 contact Rian Neogi for Zoom link\n\nAbstract:  In this work\, we introduc
 e and study stochastic\nminimum-norm optimization. We have an underlying c
 ombinatorial\noptimization problem where the costs involved are random var
 iables\nwith given distributions\; each feasible solution induces a random
 \nmultidimensional cost vector. The goal is to find a solution that\nminim
 izes the expected norm of the induced cost vector\, for a given\nmonotone\
 , symmetric norm. We give a framework for designing\napproximation algorit
 hms for stochastic minimum-norm optimization and\napply it to give approxi
 mation algorithms for stochastic minimum-norm\nversions of load balancing 
 and spanning tree problems.
DTSTAMP:20260418T215214Z
END:VEVENT
END:VCALENDAR