hw2_sol_long

Hw2_sol_long - Com S 511 Homework#2 Due on Friday Yuheng Long 1 Yuheng Long Com S 511 Homework#2 Problem 1 Problem 1(a It is suce to show that the

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

View Full Document Right Arrow Icon
Com S 511: Homework #2 Due on Friday, September 18, 2009 Yuheng Long 1
Background image of page 1

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

View Full DocumentRight Arrow Icon
Yuheng Long Com S 511 : Homework #2 Problem 1 Problem 1 (a) It is suffice to show that the flow satisfies the flow capacity constraint. Let c k ( e ) be the capacity of edge e in G k . Clearly, 2 c k - 1 ( e ) c k ( e ) 2 c k - 1 ( e ) + 1. Because, f * k - 1 is the maximum flow in G, for each edge e, f * k - 1 ( e ) c k - 1 ( e ). That is, 2 f * k - 1 ( e ) 2 c k - 1 ( e ) c k ( e ). (b) Let (A,B) be a minumum cut in G k - 1 , and c 0 k - 1 be its capacity. Then we have v ( f * k - 1 ) = c 0 k - 1 = e out of A c k - 1 ( e ). For any edge e, we have c k ( e ) 2 c k - 1 ( e ) + 1, thus e out of A c k ( e ) 2 e out of A ( c k - 1 ( e ) + 1) 2 v ( f * k - 1 ) + e out of A 1. Therefore, v ( f * k ) e out of A c k ( e ) 2 v ( f * k - 1 ) + m and v ( f * k ) - 2 v ( f * k - 1 ) m . (c) We have O ( lg C ) rounds to compute G 1 ,G 2 ,...,G B . In each round, we begin with 2 f * k - 1 and by (b), it could have at most m augmentations. In each augmentation, we use BFS/DFS to search a path, which is O(m+n) (3.13). Also, m n/ 2. Thus the overall running time is
Background image of page 2
Image of page 3
This is the end of the preview. Sign up to access the rest of the document.

This document was uploaded on 12/09/2010.

Page1 / 4

Hw2_sol_long - Com S 511 Homework#2 Due on Friday Yuheng Long 1 Yuheng Long Com S 511 Homework#2 Problem 1 Problem 1(a It is suce to show that the

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

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