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:20260308T070000
END:DAYLIGHT
BEGIN:STANDARD
TZNAME:EST
TZOFFSETFROM:-0400
TZOFFSETTO:-0500
DTSTART:20251102T060000
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
UID:6a1103da8b033
DTSTART;TZID=America/Toronto:20260605T123000
SEQUENCE:0
TRANSP:TRANSPARENT
DTEND;TZID=America/Toronto:20260605T133000
URL:https://uwaterloo.ca/combinatorics-and-optimization/events/combopt-read
 inggroup-david-aleman-unsplittable
SUMMARY:CombOpt ReadingGroup - David Aleman-Unsplittable multicommodity flo
 ws\nin fully planar instances
CLASS:PUBLIC
DESCRIPTION:SPEAKER:\n\n David Aleman\n\nAFFILIATION:\n University of Water
 loo\n\nLOCATION:\n MC 6029\n\nABSTRACT: \n\nThe multicommodity flow probl
 em involves routing multiple distinct\ncommodities through a shared networ
 k. An instance is given by\nan _undirected _graph G=(V\, E(G) ) with ed
 ge capacities\, and a\ncollection of source-sink pairs (s_i\,t_i) in V wit
 h associated\nnonnegative demands d(s_i\, t_i). It will be convenient to t
 hink of the\nsource-sink pairs as forming the edges of a demand graph H=( 
 V\, E(H)\n). A flow is _feasible_ if it routes all demands without excee
 ding\nthe edge capacities\, and it is _unsplittable_ if it routes each\n
 demand along a single path. Let C be the smallest value such that the\nexi
 stence of a feasible flow implies the existence of an unsplittable\nflow t
 hat exceeds the edge capacities by at most an additivie amount\nof C times
  the maximum demand value.  \nWe show that if G+H = (V\, E(G) U E(H) ) is
  planar\, then  1.5<= C <=\n2. \nJoint work with Kumar\, Poremba\, and Sh
 epherd. 
DTSTAMP:20260523T013314Z
END:VEVENT
END:VCALENDAR