In this talk, I will describe a new framework for approximately
solving flow problems in capacitated, undirected graphs, and I will
apply it to find approximately maximum s-t flows in almost-linear
time, improving on the best previous bound of \(...
Read More