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:69cf1bb2028c3
DTSTART;TZID=America/Toronto:20240604T133000
SEQUENCE:0
TRANSP:TRANSPARENT
DTEND;TZID=America/Toronto:20240604T143000
URL:https://uwaterloo.ca/combinatorics-and-optimization/events/ura-seminar-
 nikhil-kumar
SUMMARY:URA Seminar - Nikhil Kumar
CLASS:PUBLIC
DESCRIPTION:TITLE: Multicommodity Flows and Cuts\n\nSPEAKER:\n Nikhil Kuma
 r\n\nAFFILIATION:\n University of Waterloo\n\nLOCATION: \n MC 5501\n\nABS
 TRACT: Flow and cut problems occupy a central place in discrete\noptimzat
 ion and algorithms. The well known max-flow min-cut theorem\nstates that t
 here exists a s-t flow of value d in a network if and\nonly if the minimum
  capacity of edges whose removal separates s and t\nis at least d. In this
  talk\, we will discuss a generalization of this\nproblem to the multicomm
 odity setting and study natural necessary and\nsufficient conditions for t
 he existence of a feasible flow. We will\ndiscuss connections to approxima
 tion algorithms\, metric embeddings and\npartitions\, and survey some of t
 he classical results\, open problems\nand recent progress.
DTSTAMP:20260403T014522Z
END:VEVENT
END:VCALENDAR