Lecture23

Lecture23 - C&O 355 Lecture 23 N. Harvey Topics...

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

View Full Document Right Arrow Icon
Lecture 23 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 Weight-Splitting Method Shortest Paths Primal-Dual Interpretation Local-Ratio Method Max Cut
Background image of page 2
k Weight-Splitting Method Let C ½ R n be set of feasible solutions to some optimization problem. Let w 2 R n be a “weight vector”. x is “optimal under w” if x optimizes min { w T y : y 2 C } Lemma: Suppose w = w 1 + w 2 . Suppose that x is optimal under w 1 , and x is optimal under w 2 . Then x is optimal under w. Hassin ‘82 Frank ‘81
Background image of page 3

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

View Full DocumentRight Arrow Icon
Weight-Splitting Method Appears in this paper: Andr á s Frank
Background image of page 4
Weight-Splitting Method Scroll down a bit… Andr á s Frank Weight-Splitting Method was discovered in U. Waterloo C&O Department!
Background image of page 5

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

View Full DocumentRight Arrow Icon
ShortestPath ( G, S, t, w ) Input: Digraph G = (V,A), source vertices S μ V, destination vertex t 2 V, and integer lengths w(a), such that w(a)>0, unless both endpoints of a are in S. Output: A shortest path from some s 2 S to t. If t 2 S, return the empty path p=() Set w 1 (a)=1 for all a 2 ± + (S), and w 1 (a)=0 otherwise Set w 2 = w - w 1 . Set S’ = S [ { u : 9 s 2 S with w 2 ( (s,u) ) = 0 } Set p’ = (v 1 ,v 2 , ,t) = ShortestPath ( G, S’, t, w 2 ) If v 1 2 S, then set p=p’ Else, set p=(s,v 1 ,v 2 , ,t) where s 2 S and w 2 ( (s,v 1 ) )=0 Return path p To find shortest s-t path, run ShortestPath(G, {s}, t, w)
Background image of page 6
Claim: Algorithm returns a shortest path from S to t. Proof: By induction on number of recursive calls. If t 2 S, then the empty path is trivially shortest. Otherwise, p’ is a shortest path from S’ to t under w 2 . So p is a shortest path from S to t under w 2 . (Note: length w 2 (p)=length w 2 (p ’), because if we added an arc, it has w 2 -length 0.) Note: p cannot re-enter S, otherwise a subpath of p would be a shorter S-t path. So p uses exactly one arc of ± + (S). Correctness of Algorithm s s' S t Path p This is a shorter S-t path
Background image of page 7

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

View Full DocumentRight Arrow Icon
Claim: Algorithm returns a shortest path from S to t. Proof: By induction on number of recursive calls. If t 2 S, then the empty path is trivially shortest. Otherwise, p’ is a shortest path from S’ to t under w 2 . So p is a shortest path from S to t under w 2 . (Note: length w 2 (p)=length w 2 (p’), because if we added an arc, it has w 2 -length 0.) Note: p cannot re-enter S, otherwise a subpath of p would be a shorter S-t path. So p uses exactly one arc of ± + (S). So length w 1 (p)=1. But any S-t path has length at least 1 under w 1 . So p is a shortest path from S to t under w 1 . ) p is a shortest S-t path under arc-lengths w,
Background image of page 8
Image of page 9
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 / 26

Lecture23 - C&O 355 Lecture 23 N. Harvey Topics...

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

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