BEGIN:VCALENDAR
PRODID:-//eluceo/ical//2.0/EN
VERSION:2.0
CALSCALE:GREGORIAN
BEGIN:VEVENT
UID:www.tcs.tifr.res.in/event/1751
DTSTAMP:20260721T043823Z
SUMMARY:On the Single-Source Unsplittable Flow Problem
DESCRIPTION:Speaker: Soumyadeep Paul (TIFR)\n\nAbstract: \nThe single-sourc
 e unsplittable flow problem deals with a graph $G$\, source single source 
 $s$ and $k$ terminals for $k$ commodities. We want to find a flow such tha
 t each commodity is routed along exactly one path. I will be presenting th
 e main algorithm that shows how to get an unsplittable flow such that the 
 flow across an edge is violated by at most the maximum demand\, assuming a
  feasible flow exists. In graphs which satisfy that the maximum demand is 
 less than the minimum capacity and a feasible flow exists\, we will see ho
 w to get a flow of congestion at most 2\, that all demands can be satisfie
 d as a union of 5 unsplittable flows and that 22.6% of the total demand ca
 n be satisfied unsplittably.\nBased on the following paper: https://link.
 springer.com/article/10.1007/s004930050043\n
URL:https://www.tcs.tifr.res.in/web/events/1751
DTSTART;TZID=Asia/Kolkata:20260723T140000
DTEND;TZID=Asia/Kolkata:20260723T150000
LOCATION:A-201 (STCS Seminar Room)
END:VEVENT
END:VCALENDAR