26_3 - Contents Maximum flow problem Minimum cut problem...

Info icon This preview shows pages 1–2. Sign up to view the full content.

View Full Document Right Arrow Icon
1 Contents Maximum flow problem. Minimum cut problem. Max-flow min-cut theorem. Augmenting path algorithm. Capacity-scaling. Shortest augmenting path. Max-Flow Min-Cut Theorem MAX-FLOW MIN-CUT THEOREM (Ford-Fulkerson, 1956): In any network, the value of the max flow is equal to the value of the min cut. Proof: ? Flow value = 28 s 2 3 4 5 6 7 t 15 5 30 15 10 8 15 9 6 10 10 10 15 4 4 10 9 9 14 14 4 10 4 8 9 1 0 0 0 0 Cut capacity = 28 Flow value = 0 s 4 2 5 3 t 4 0 0 0 0 0 0 4 0 4 4 10 13 10 Towards an Algorithm Find an s-t path where each edge e=(u,v) has c(e) > f(e) and "augment" flow along the path. Towards an Algorithm Find an s-t path where each arc e=(u,v) has c(e) > f(e) and "augment" flow along the path. Repeat until you get stuck. Flow value = 10 s 4 2 5 3 t 4 0 0 0 0 0 0 4 0 4 4 10 13 10 10 10 10 The design of this algorithm? Towards an Algorithm Find an s-t path where each arc has u(e) > f(e) and "augment" flow along the path. Repeat until you get stuck. The straight forward greedy algorithm fails. Flow value = 10 s 4 2 5 3 t 10 13 10 4 0 0 0 4 0 4 4 10 10 10 Flow value = 14 s 4 2 5 3 t 10 13 10 4 4 4 4 10 4 4 10 6 4 4 Residual Network Let f be a flow on G = (V, E). The residual network G f = (V, E f )
Image of page 1

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full Document Right Arrow Icon
Image of page 2
This is the end of the preview. Sign up to access the rest of the document.

{[ snackBarMessage ]}

What students are saying

  • Left Quote Icon

    As a current student on this bumpy collegiate pathway, I stumbled upon Course Hero, where I can find study resources for nearly all my courses, get online help from tutors 24/7, and even share my old projects, papers, and lecture notes with other students.

    Student Picture

    Kiran Temple University Fox School of Business ‘17, Course Hero Intern

  • Left Quote Icon

    I cannot even describe how much Course Hero helped me this summer. It’s truly become something I can always rely on and help me. In the end, I was not only able to survive summer classes, but I was able to thrive thanks to Course Hero.

    Student Picture

    Dana University of Pennsylvania ‘17, Course Hero Intern

  • Left Quote Icon

    The ability to access any university’s resources through Course Hero proved invaluable in my case. I was behind on Tulane coursework and actually used UCLA’s materials to help me move forward and get everything together on time.

    Student Picture

    Jill Tulane University ‘16, Course Hero Intern