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:69d12f565bfd3
DTSTART;TZID=America/Toronto:20231013T130000
SEQUENCE:0
TRANSP:TRANSPARENT
DTEND;TZID=America/Toronto:20231013T130000
URL:https://uwaterloo.ca/combinatorics-and-optimization/events/co-reading-g
 roup-nikhil-kumar-0
SUMMARY:C&O Reading Group - Nikhil Kumar
CLASS:PUBLIC
DESCRIPTION:TITLE: Approximate Max-Flow Min-Multicut Theorem for Graphs of 
 Bounded\nTreewidth\, Part II\n\nSPEAKER:\n Nikhil Kumar\n\nAFFILIATION:\n 
 University of Waterloo\n\nLOCATION:\n MC 6029\n\nABSTRACT: I will present 
 a recent max-flow min-cut type result for\ngraphs of bounded treewidth. Mu
 lticommodity 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 t
 he total flow. A natural\nupper bound on the value of total flow is the va
 lue of the minimum\nmulticut : the minimum total capacity of edges that ne
 ed to be removed\nin order to disconnect all the source-sink pairs. We wil
 l 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(log r)·F.
DTSTAMP:20260404T153342Z
END:VEVENT
END:VCALENDAR