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:686fdceb0c7b1
DTSTART;TZID=America/Toronto:20240614T153000
SEQUENCE:0
TRANSP:TRANSPARENT
DTEND;TZID=America/Toronto:20240614T163000
URL:/combinatorics-and-optimization/events/tutte-colloq
 uium-chaitanya-swamy-1
SUMMARY:Tutte Colloquium - Chaitanya Swamy
CLASS:PUBLIC
DESCRIPTION:Summary \n\nTITLE: Stochastic Minimum Norm Combinatorial Optim
 ization\n\nSPEAKER:\n Chaitanya Swamy\n\nAFFILIATION:\n University of Wate
 rloo\n\nLOCATION:\n MC 5501\n\nABSTRACT: We develop a framework for desig
 ning approximation\nalgorithms for a wide class of (1-stage) stochastic-op
 timization\nproblems with norm-based objective functions. We introduce the
  model\nof stochastic minimum-norm combinatorial optimization\, wherein th
 e\ncosts involved are random variables with given distributions\, and we\n
 are given a monotone\, symmetric norm f. Each feasible solution induces\na
  random multidimensional cost vector whose entries are independent\nrandom
  variables\, and the goal is to find a solution that minimizes\nthe expect
 ed f-norm of the induced cost vector. This is a very rich\nclass of object
 ives\, containing all l_p norms\, as also Top-l norms\n(sum of l largest c
 oordinates in absolute value)\, which enjoys various\nclosure properties.\
 n 
DTSTAMP:20250710T153155Z
END:VEVENT
END:VCALENDAR