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:20230312T070000
END:DAYLIGHT
BEGIN:STANDARD
TZNAME:EST
TZOFFSETFROM:-0400
TZOFFSETTO:-0500
DTSTART:20221106T060000
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
UID:69d0d14720a7a
DTSTART;TZID=America/Toronto:20231006T130000
SEQUENCE:0
TRANSP:TRANSPARENT
DTEND;TZID=America/Toronto:20231006T130000
URL:https://uwaterloo.ca/combinatorics-and-optimization/events/co-reading-g
 roup-nikhil-kumar
SUMMARY:C&O Reading Group - Nikhil Kumar
CLASS:PUBLIC
DESCRIPTION:TITLE: Approximate Max-Flow Min-Multicut Theorem for Graphs of 
 Bounded\nTreewidth\n\nSPEAKER:\n Nikhil Kumar\n\nAFFILATION:\n University 
 of Waterloo\n\nLOCATION:\n MC 6029\n\nABSTRACT: I will present a recent ma
 x-flow min-cut type result for\ngraphs of bounded treewidth. Multicommodit
 y flow is a generalization\nof the well known s-t flow problem\, where we 
 are given multiple\nsource-sink pairs and goal is to maximize the total fl
 ow. A natural\nupper bound on the value of total flow is the value of the 
 minimum\nmulticut : the minimum total capacity of edges that need to be re
 moved\nin order to disconnect all the source-sink pairs. We will show that
 \ngiven a treewidth-r graph\, there exists a (fractional) multi-commodity\
 nflow of value F\, and a multicut of capacity C such that F ≤ C ≤\nO(l
 og r)·F.
DTSTAMP:20260404T085223Z
END:VEVENT
END:VCALENDAR