BEGIN:VCALENDAR
PRODID:-//eluceo/ical//2.0/EN
VERSION:2.0
CALSCALE:GREGORIAN
BEGIN:VEVENT
UID:www.tcs.tifr.res.in/event/290
DTSTAMP:20230914T125918Z
SUMMARY:A Simple Combinatorial Algorithm for Submodular Function Minimizati
 on
DESCRIPTION:Speaker: Sagnik  Mukhopadhyay\n\nAbstract: \nSubmodular functio
 ns are important to study as they arise in many context as flow problems\,
  game theoretic application etc. One important aspect to study about submo
 dular function is the submodular function minimization. I will present an 
 algorithm for minimizing integer valued submodular function. The algorithm
  runs in $O(n^6.EO.\\log nM)$ time\, where $n$ is cardinality of ground se
 t\, $M$ is maximum absolute value of the function\, and $EO$ is the time f
 or function evaluation.\nRef: Iwata S\, Orlin J\; A Simple Combinatorial A
 lgorithm for Submodular Function Minimization\; SODA 2009\n
URL:https://www.tcs.tifr.res.in/web/events/290
DTSTART;TZID=Asia/Kolkata:20120713T150000
DTEND;TZID=Asia/Kolkata:20120713T163000
LOCATION:A-212 (STCS Seminar Room)
END:VEVENT
END:VCALENDAR