BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//Computer Science and Engineering - ECPv6.13.0//NONSGML v1.0//EN
CALSCALE:GREGORIAN
METHOD:PUBLISH
X-WR-CALNAME:Computer Science and Engineering
X-ORIGINAL-URL:https://homecse.iitd.ac.in
X-WR-CALDESC:Events for Computer Science and Engineering
REFRESH-INTERVAL;VALUE=DURATION:PT1H
X-Robots-Tag:noindex
X-PUBLISHED-TTL:PT1H
BEGIN:VTIMEZONE
TZID:Asia/Kolkata
BEGIN:STANDARD
TZOFFSETFROM:+0530
TZOFFSETTO:+0530
TZNAME:IST
DTSTART:20260101T000000
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
DTSTART;TZID=Asia/Kolkata:20260205T120000
DTEND;TZID=Asia/Kolkata:20260205T130000
DTSTAMP:20261010T144524
CREATED:20260131T075508Z
LAST-MODIFIED:20260131T075508Z
UID:2410-1770292800-1770296400@homecse.iitd.ac.in
SUMMARY:Approximately Packing Dijoins Via Nowhere-Zero Flows by Dr. Ravi
DESCRIPTION:Venue: Bharti501 \nAbstract: In a digraph\, a dicut is a cut where all the arcs cross in one direction. A dijoin is a subset of arcs that intersects each dicut. Woodall conjectured in 1976 that in every digraph\, the minimum size of a dicut equals to the maximum number of disjoint dijoins. By building connections with nowhere-zero k-flows\, we prove that every digraph with minimum dicut size $\tau$ contains $\lfloor \tau/k \rfloor$ disjoint dijoins if the underlying undirected graph admits a nowhere-zero k-flow. \nJoint work with Gérard Cornuéjols (CMU) and Siyue Liu (CMU) \nSpeaker Bio: Dr. Ravi is the Vasantrao Dempo Professor of Operations Research and Computer Science at Carnegie Mellon University. His research is on models\, methods and applications of discrete optimization and their application to business and technological systems. He has published widely in diverse areas ranging from theoretical computer science to Operations and Marketing. In Computer Science\, his main research interests are in approximation algorithms and network optimization.
URL:https://homecse.iitd.ac.in/event/approximately-packing-dijoins-via-nowhere-zero-flows-by-dr-ravi/
LOCATION:Bharti 501\, IIT Campus\, Hauz Khas\, New Delhi
END:VEVENT
END:VCALENDAR