State the maximum-flow problem as a linear-programming problem.... | Filo

Lecture 13: Incremental Improvement: Max Flow, Min Cut | Design and Analysis of Algorithms | Electrical Engineering and Computer Science | MIT OpenCourseWare

For every positive integer U, show that there is an instance of the maximum flowproblem with edge capacities in {1,2,..., U} and a choice of augmenting pathsso that the Ford-Fulkerson algorithm runs for at least U iterations before termi-nating. The number of vertices and edges in your networks should be boundedabove by constant, independent of U. (This shows that the algorithm is onlyp̈seudopolynomial.)̈[Hint: use a network similar to the examples discussed in lecture.]