\documentclass{article} \usepackage{me} \setlength{\parindent}{0pt}
\begin{center} Lecture 9: Advanced Max Flow Algorithm \end{center}

Strongly Polynomial Max Flow Algorithm

Our New Goal: Design an augmenting path based algorithm that aims to increase the $s$-$t$ distance $d_f(s,t)$ in the residual graph. (Instead of trying to directly push as much flow "as possible” in each iteration - which was the case before in the maximum bottleneck capacity augmenting path algorithm.)