Lecture22

Lecture22 - C&O 355 Lecture 22 N. Harvey Topics...

Info iconThis preview shows pages 1–6. Sign up to view the full content.

View Full Document Right Arrow Icon
Lecture 22 N. Harvey
Background image of page 1

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

View Full DocumentRight Arrow Icon
Topics Integral Polyhedra Minimum s-t Cuts via Ellipsoid Method Weight-Splitting Method Shortest Paths
Background image of page 2
Minimum s-t Cuts (LP) Theorem: Every optimal BFS of (LP) is optimal for (IP). (IP) So to solve (IP), we can just solve (LP) and return an optimal BFS. To solve (LP), the separation oracle is: (Lecture 12) Check if y a < 0 for any a 2 A. If so, the constraint “y a ¸ 0” is violated. Check if dist y (s,t)<1. If so, let p be an s-t path with length y (p)<1. Then the constraint for path p is violated. So to compute min s-t cuts, we just need an algorithm to compute shortest dipaths! (Lecture 21)
Background image of page 3

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

View Full DocumentRight Arrow Icon
Shortest Paths in a Digraph Let G=(V,A) be a directed graph. Every arc a has a “length” w a >0. Given two vertices s and t, find a path from s to t of minimum total length. 3 1 8 7 1 5 1 2 2 2 3 2 4 1 2 s t These edges form a shortest s-t path
Background image of page 4
Let b be vector with b s =1, b t =-1, b v =0 8 v 2 V n {s,t} Consider the IP: And the LP relaxation: Theorem: Every optimal BFS of (LP) is optimal for (IP). (Assignment 5)
Background image of page 5

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

View Full DocumentRight Arrow Icon
Image of page 6
This is the end of the preview. Sign up to access the rest of the document.

This note was uploaded on 06/16/2011 for the course C 355 taught by Professor Harvey during the Fall '09 term at Waterloo.

Page1 / 12

Lecture22 - C&amp;O 355 Lecture 22 N. Harvey Topics...

This preview shows document pages 1 - 6. Sign up to view the full document.

View Full Document Right Arrow Icon
Ask a homework question - tutors are online