lecture_14 - Faster maximum flow algorithms Notations. n =...

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

View Full Document Right Arrow Icon
Faster maximum flow algorithms Notations. n = number of vertices; m = number of edges; integer C = max capacity. caling FF O(m 2 g C) time. Scaling FF : O(m log C) time. : O(m 2 n) time; edge capacity can be arbitrarily large real number. 2 m) or O(n 3 ) time. King, Rao & Tarjan: O(n m log n) time.
Background image of page 1

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

View Full DocumentRight Arrow Icon
Inefficiency of Ford and Fulkerson algorithm max flow = 2,000,000 s t v 1,000,000 1 1,000,000 u 1,000,000 1,000,000 s u t v 1 /1,000,000 1 1 /1,000,000 1,000,000 1,000,000 Flow value = 1
Background image of page 2
Inefficiency of Ford and Fulkerson algorithm residual network s t v 999,999 1 1,000,000 1 1 u 999,999 1,000,000 s u t v 999,999 1 999,999 1,000,000 1,000,000 1 1
Background image of page 3

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

View Full DocumentRight Arrow Icon
Inefficiency of Ford and Fulkerson algorithm augmenting path s t v 999,999 1 1,000,000 1 1 lue = 2 s u t v 1 /1,000,000 0 1 /1,000,000 1 /1,000,000 1 /1,000,000 u 999,999 1,000,000 value = 2
Background image of page 4
Inefficiency of Ford and Fulkerson algorithm residual network s t v 999,999 1 999,999 1 1 1 1 u 999,999 999,999 s u t v 999,999 1 999,999 999,999 999,999 1 1 1 1
Background image of page 5

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

View Full DocumentRight Arrow Icon
Inefficiency of Ford and Fulkerson algorithm lue = s t v 999,999 1 99,999 999,999 1 1 1 1 s u t v 2 /1,000,000 1 2 /1,000,000 1 /1,000,000 1 /1,000,000 value = 3 u 999,999 999,999
Background image of page 6
Scaling algorithm: find an augmenting path with large capacity. 2m log C augmentations and O(m 2 log C) time. Edmond & Karp: find the shortest path in terms of number of edges (breadth first search). mn augmentaions; O(m
Background image of page 7

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

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

Page1 / 16

lecture_14 - Faster maximum flow algorithms Notations. n =...

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

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