{[ promptMessage ]}

Bookmark it

{[ promptMessage ]}

L08-submodular - Submodular Functions in Combintorial...

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

View Full Document Right Arrow Icon
1 Submodular Functions in Combintorial Optimization Lecture 6: Jan 26 Lecture 8: Feb 1
Image of page 1

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

View Full Document Right Arrow Icon
2 Outline submodular supermodular Survey of results, open problems, and some proofs.
Image of page 2
3 Gomory-Hu Tree A compact representation of all minimum s-t cuts in undirected graphs! To compute s-t cut, look at the unique s-t path in the tree, and the bottleneck capacity is the answer! And furthermore the cut in the tree is the cut of the graph!
Image of page 3

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

View Full Document Right Arrow Icon
4 [Menger 1927] maximum number of edge disjoint s-t paths = minimum size of an s-t cut. Edge Disjoint Paths
Image of page 4
5 Graph Connectivity (Robustness) A graph is k-edge-connected if removal of any k-1 edges the remaining graph is still connected. (Connectedness) A graph is k-edge-connected if any two vertices are linked by k edge-disjoint paths. By Menger, these two definitions are equivalent.
Image of page 5

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

View Full Document Right Arrow Icon
6 Edge Splitting-off Theorem edge-splitting at  x [Lovasz]   If x is of even degree, then there is a suitable splitting-off at x x x suitable  splitting at  x , if for every pair  a,b V(G)-x , there are still k-edge-disjoint paths between a and b. G G’
Image of page 6
7 Connectivity Augmentation Given a directed graph, add a minimum number of edges to make it k-edge-connected.
Image of page 7

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

View Full Document Right Arrow Icon
Image of page 8
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