BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//UC Irvine Donald Bren School of Information &amp; Computer Sciences - ECPv6.3.4//NONSGML v1.0//EN
CALSCALE:GREGORIAN
METHOD:PUBLISH
X-WR-CALNAME:UC Irvine Donald Bren School of Information &amp; Computer Sciences
X-ORIGINAL-URL:https://ics.uci.edu
X-WR-CALDESC:Events for UC Irvine Donald Bren School of Information &amp; Computer Sciences
REFRESH-INTERVAL;VALUE=DURATION:PT1H
X-Robots-Tag:noindex
X-PUBLISHED-TTL:PT1H
BEGIN:VTIMEZONE
TZID:America/Los_Angeles
BEGIN:DAYLIGHT
TZOFFSETFROM:-0800
TZOFFSETTO:-0700
TZNAME:PDT
DTSTART:20260308T100000
END:DAYLIGHT
BEGIN:STANDARD
TZOFFSETFROM:-0700
TZOFFSETTO:-0800
TZNAME:PST
DTSTART:20261101T090000
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
DTSTART;TZID=America/Los_Angeles:20260306T110000
DTEND;TZID=America/Los_Angeles:20260306T120000
DTSTAMP:20261012T050234
CREATED:20260206T171235Z
LAST-MODIFIED:20260206T171235Z
UID:27888-1772794800-1772798400@ics.uci.edu
SUMMARY:Approximately Packing Dijoins Via Nowhere-Zero Flows
DESCRIPTION:Abstract: 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. Joint work with Gérard Cornuéjols (CMU) and Siyue Liu (CMU) \nBio: 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://ics.uci.edu/event/approximately-packing-dijoins-via-nowhere-zero-flows/
LOCATION:Donald Bren Hall\, Irvine\, CA\, 92697\, United States
ATTACH;FMTTYPE=image/jpeg:https://ics.uci.edu/wp-content/uploads/2026/02/R-Ravi-resize.jpg
END:VEVENT
END:VCALENDAR