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:69e3bc7addd97
DTSTART;TZID=America/Toronto:20221209T120000
SEQUENCE:0
TRANSP:TRANSPARENT
DTEND;TZID=America/Toronto:20221209T120000
URL:https://uwaterloo.ca/combinatorics-and-optimization/events/combinatoria
 l-optimization-reading-group-david-aleman-1
SUMMARY:Combinatorial Optimization Reading Group - David Aleman
CLASS:PUBLIC
DESCRIPTION:TITLE: Approximation algorithm for stochastic k-TSP\n\nSpeaker
 :\n David Aleman\n\nAffiliation:\n University of Waterloo\n\nLocation:\n M
 C 6029 or contact Rian Neogi for Zoom link\n\nABSTRACT: The input of th
 e deterministic k-TSP problem consists of a\nmetric complete graph with ro
 ot p in which the nodes are assigned a\nfixed non-negative reward. The obj
 ective is to construct a p-rooted\npath of minimum length that collects to
 tal reward at least k. In this\ntalk we will explore a stochastic variant 
 of this problem in which the\nrewards assigned to the nodes are independen
 t random variables\, and\nthe objective is to derive a policy that minimiz
 es the expected length\nof a p-rooted path that collects total reward at l
 east k. We will\ndiscuss approximation algorithms for this problem propose
 d in a paper\nby Ene\, Nagarajan and Saket\, and a paper by Jiang\, Li\, L
 iu and Singla.
DTSTAMP:20260418T171642Z
END:VEVENT
END:VCALENDAR