22 views

Uploaded by Sean Li

Notes from lecture. Cornell University, Spring 2013.

save

- CS 4820-Lecture 6
- CS 4820-Lecture 4
- CS 4820-Lecture 7
- CS 4820-Lecture 3
- CS 4820-Lecture 10
- CS 4820-Lecture 9
- CS 4820-Lecture 2
- CS 4820-Lecture 8
- CS 4820-Lecture 5
- CS 4820-Lecture 16
- CS 4820-Lecture 11
- CS 4820-Lecture 15
- CS 4820-Lecture 1
- CS 4820-Lecture 12
- CS 4820-Lecture 18
- CS 4820-Lecture 14
- CS 4820-Lecture 13
- Math 7370-Lecture 19
- Math 7370-Lecture 23
- Math 7370-Lecture 18
- Math 4340-Lecture 19
- Math-6170-Lec-01
- Math 7370-Lecture 24
- Math 4340-Lecture 24
- Math 7370-Lecture 22
- Math 4340-Lecture 20
- Math 7370-Lecture 21
- Math 4340-Lecture 22
- Math 4340-Lecture 23
- Math 7370-Lecture 20
- Math 6710 Lec 01
- Math 6210 Lec 01
- Math 4340-Lecture 18
- CS 4820-Lecture 16
- CS 4820-Lecture 15
- Math 7370-Lecture 15
- Math 7370-Lecture 16
- CS 4820-Lecture 18
- Math 4340-Lecture 14
- Math 7370-Lecture 13
- CS 4820-Lecture 14
- Math 4340-Lecture 15
- Math 4340-Lecture 17
- Math 7370-Lecture 14
- Math 7370-Lecture 17
- Math 4340-Lecture 16

You are on page 1of 1

Ford-Fulkerson Algorithm. Has complexity O(mc), where C = minA,B {c(A, B)}. Works with rational capacities as well. However, it does not necessarily halt with √irrational capacities: Consider 3 paths with 1, ϕ−1 , ϕ−2 , where ϕ is the golden ratio 1+2 5 . Write r = ϕ−1 . Then r2 = 1 − r, and rk+2 = rk − rk−1 in general. We can obtain paths that go to 0 but do not reach 0 in ﬁnite time. Scaling Algorithm. Take ∆ to be the highest power of 2 less than or equal to the min capacity. Compute augmenting paths, and repeat with ∆ := ∆/2. Complexity is O(m log C). Lemma. Each scaling phase takes at most 2m augmentations and takes O(m2 ) time.

- CS 4820-Lecture 6Uploaded bySean Li
- CS 4820-Lecture 4Uploaded bySean Li
- CS 4820-Lecture 7Uploaded bySean Li
- CS 4820-Lecture 3Uploaded bySean Li
- CS 4820-Lecture 10Uploaded bySean Li
- CS 4820-Lecture 9Uploaded bySean Li
- CS 4820-Lecture 2Uploaded bySean Li
- CS 4820-Lecture 8Uploaded bySean Li
- CS 4820-Lecture 5Uploaded bySean Li
- CS 4820-Lecture 16Uploaded bySean Li
- CS 4820-Lecture 11Uploaded bySean Li
- CS 4820-Lecture 15Uploaded bySean Li
- CS 4820-Lecture 1Uploaded bySean Li
- CS 4820-Lecture 12Uploaded bySean Li
- CS 4820-Lecture 18Uploaded bySean Li
- CS 4820-Lecture 14Uploaded bySean Li
- CS 4820-Lecture 13Uploaded bySean Li

- Math 7370-Lecture 19Uploaded bySean Li
- Math 7370-Lecture 23Uploaded bySean Li
- Math 7370-Lecture 18Uploaded bySean Li
- Math 4340-Lecture 19Uploaded bySean Li
- Math-6170-Lec-01Uploaded bySean Li
- Math 7370-Lecture 24Uploaded bySean Li
- Math 4340-Lecture 24Uploaded bySean Li
- Math 7370-Lecture 22Uploaded bySean Li
- Math 4340-Lecture 20Uploaded bySean Li
- Math 7370-Lecture 21Uploaded bySean Li
- Math 4340-Lecture 22Uploaded bySean Li
- Math 4340-Lecture 23Uploaded bySean Li
- Math 7370-Lecture 20Uploaded bySean Li
- Math 6710 Lec 01Uploaded bySean Li
- Math 6210 Lec 01Uploaded bySean Li
- Math 4340-Lecture 18Uploaded bySean Li
- CS 4820-Lecture 16Uploaded bySean Li
- CS 4820-Lecture 15Uploaded bySean Li
- Math 7370-Lecture 15Uploaded bySean Li
- Math 7370-Lecture 16Uploaded bySean Li
- CS 4820-Lecture 18Uploaded bySean Li
- Math 4340-Lecture 14Uploaded bySean Li
- Math 7370-Lecture 13Uploaded bySean Li
- CS 4820-Lecture 14Uploaded bySean Li
- Math 4340-Lecture 15Uploaded bySean Li
- Math 4340-Lecture 17Uploaded bySean Li
- Math 7370-Lecture 14Uploaded bySean Li
- Math 7370-Lecture 17Uploaded bySean Li
- Math 4340-Lecture 16Uploaded bySean Li