Computer Science and Engineering

Theory Seminar

New algorithms and lower bounds for all-pairs max flow

Ohad TrabelsiWeizmann Institute
SHARE:

Abstract: When can maximum flow be solved for all pairs of nodes faster than naively solving it separately for each pair? We will overview new algorithms – including a very recent result!, and also lower bounds (under some popular assumptions).

Organizer

Greg Bodwin

Organizer

Euiwoong Lee