Lecture13 - Graphs and Network Flows IE411 Lecture 13 Dr...

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

Graphs and Network Flows IE411 Lecture 13 Dr. Ted Ralphs
Image of page 1

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

IE411 Lecture 13 1 References for Today’s Lecture
Image of page 2
IE411 Lecture 13 2 References for Today’s Lecture Required reading Sections 21.1–21.2 References AMO Chapter 6 CLRS Sections 26.1–26.2
Image of page 3

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

IE411 Lecture 13 3 Labeling Algorithm (Ford and Fulkerson (1956)) Fill in details of generic augmenting path algorithm how to identify augmenting path (or show no path exists) whether algorithm terminates in finite number of iterations whether final flow value is maximal The labeling algorithm is the most straightforward variant. The cost to find the augmenting path is low, but the number of augmnentations can be high. Depth-first search is a special case.
Image of page 4
IE411 Lecture 13 4 Identifying an Augmenting Path Use search technique to find a directed path in G ( x ) from s to t At any step, partition nodes into labeled and unlabeled Iteratively select a labeled node and scan its arc adjacency list in G ( x ) to reach and label additional nodes When sink becomes labeled, augment flow, erase labels and repeat Terminate when all labeled nodes have been scanned and sink remains unlabeled
Image of page 5

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

IE411 Lecture 13 5 Labeling Algorithm Input: A network G = ( N, A ) and a vector of capacities u Z A Output: x represents the maximum flow from node s to node t label node t while t is labeled
Image of page 6
Image of page 7
This is the end of the preview. Sign up to access the rest of the document.
  • Spring '14
  • TedRalphs
  • Graph Theory, Flow network, Maximum flow problem, Max-flow min-cut theorem, lower bounds, Integrality Theorem

{[ 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