BEGIN:VCALENDAR
VERSION:2.0
PRODID:researchseminars.org
CALSCALE:GREGORIAN
X-WR-CALNAME:researchseminars.org
BEGIN:VEVENT
SUMMARY:Yang Liu (Stanford University)
DTSTART:20201202T180000Z
DTEND:20201202T190000Z
DTSTAMP:20260423T021010Z
UID:TCSPlus/19
DESCRIPTION:Title: <a href="https://researchseminars.org/talk/TCSPlus/19/"
 >Faster Algorithms for Unit Maximum Flow</a>\nby Yang Liu (Stanford Univer
 sity) as part of TCS+\n\n\nAbstract\nThe maximum flow problem is one of th
 e most well-studied problems in combinatorial optimization\, encompassing 
 a broad range of cut\, matching\, and scheduling problems. Here we present
  a recent line of work obtaining provably faster algorithms for solving th
 e maximum flow problem using interior point methods. In particular\, we sh
 ow how to solve the maximum flow problem in m-edge unit capacity graphs in
  time almost $m^{4/3}$\, improving over the breakthrough $m^{10/7}$ time a
 lgorithm of Mądry.\n\nThis is based on joint work with Aaron Sidford (htt
 ps://arxiv.org/abs/1910.14276 and https://arxiv.org/abs/2003.08929).\n
LOCATION:https://researchseminars.org/talk/TCSPlus/19/
END:VEVENT
END:VCALENDAR