11moreonpreflowpushalgorithms

# - 15.082 and 6.855J Max Flows 4 1 Overview of todays lecture Very quick review of Preflow Push Algorithm The Excess Scaling Algorithm O(n2 log U

This preview shows pages 1–14. Sign up to view the full content.

1 15.082 and 6.855J March 13, 2003 Max Flows 4

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

View Full Document
2 Overview of today’s lecture ± Very quick review of Preflow Push Algorithm ± The Excess Scaling Algorithm z O(n 2 log U) non-saturating pushes z O(nm + n 2 log U) running time. ± A proof that Highest Preflow Push uses O(n 2 m 1/2 ) non-saturating pushes.
3 A Feasible Preflow s 3 4 2 5 t 3 3 3 2 2 2 2 1 2 0 0 1 The excess e(j) at each node j s, t is the flow in minus the flow out. Note: total excess = flow out of s minus flow into t.

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

View Full Document
4 Active nodes 0 2 s 3 4 2 5 t 3 3 3 2 2 1 0 2 2 1 Nodes with positive excess are called active . The preflow push algorithm will try to push flow from active nodes towards the sink, relying on d( ).
5 Review of Distance Labels Distance labels d( ) are valid for G(x) if i. d(t) = 0 ii. d(i) d(j) + 1 for each (i,j) G(x) Defn. An arc (i,j) is admissible if r ij > 0 and d(i) = d(j) + 1. Lemma. Let d( ) be a valid distance label. Then d(i) is a lower bound on the distance from i to t in the residual network.

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

View Full Document
6 Goldberg-Tarjan Preflow Push Algorithm Procedure Preprocess begin x :=0; compute the exact distance labels d(i) for each node; x sj := u sj for each arc (s,j) A(s); d(s) := n; end Algorithm PREFLOW-PUSH; begin preprocess; while there is an active node i do begin select an active node i; push/relabel(i); end; end;
Preprocess Step 4 1 1 4 2 2 2 3 3 1 s 2 4 5 3 t 0 5 4 3 2 1 t 4 5 3 s 2 0 2 1 1 1 3 2 6 s 3 Saturate arcs out of node s. Move excess to the adjacent arcs Relabel node s after all incident arcs have been saturated.

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

View Full Document
Select, then relabel/push 4 1 1 4 2 2 2 3 3 1 s 2 4 5 3 t 0 5 4 3 2 1 t 4 5 3 s 2 0 2 1 1 1 3 2 3 6 s 1 Select an active node. Note : Each arc gets saturated O(n) times. Push/Relabel Update excess after a push 8
Select, then relabel/push 4 1 1 4 2 2 2 3 3 1 s 2 4 5 3 t 0 5 4 3 2 1 t 4 5 3 s 2 0 2 1 1 1 3 2 6 s 1 2 3 Select an active node. Note. Each node gets relabeled O(n) times. No arc incident to the selected node is admissible. So relabel. 9

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

View Full Document
Select, then relabel/push 4 1 1 4 2 2 2 3 3 1 s 2 4 5 t 0 5 4 3 2 1 t 4 5 s 2 0 2 1 1 3 2 6 s 1 2 3 3 1 1 Bounding non-saturating pushes is more complex. Note that the active node became inactive. 10 Select an active node Push/Relabel
11 Excess Scaling Approach Let be a “scaling” parameter. In the -scaling phase e(j) ≤∆ for all j. At the end of the scaling phase e(j) < /2, for all j, at which point the /2-scaling phase begins. We start with > U. The last scaling phase is the 1- scaling phase. e(j) 1 for all j. At the end of the 1-scaling phase, we have a flow, and the flow is optimal. Note: the number of phases is O(log U+1)

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

View Full Document
12 Algorithm excess scaling begin preprocess := 2 log U ; while ∆≥ 1 do begin while the network contains a node j with e(j) ≥∆ /2 do begin among nodes j with e(j) /2 (called large excess nodes ), choose i with minimum distance label perform push/relabel(i) while ensuring that no node excess exceeds ; end := /2 end
13 Pushing in the 64-scaling phase 0 5 4 3 2 1 t 4 5 s 2 s 7 9 8 7 6 9 6 3 8 5 j 32 e(j) 64 “large excess” i e(i) < 32 4 7 5 62 02 5 24 0 For each admissible arc (i,j), j is not large excess.

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

View Full Document
This is the end of the preview. Sign up to access the rest of the document.

## This note was uploaded on 03/15/2010 for the course IE 505 taught by Professor Yok during the Spring '10 term at Galatasaray Üniversitesi.

### Page1 / 46

- 15.082 and 6.855J Max Flows 4 1 Overview of todays lecture Very quick review of Preflow Push Algorithm The Excess Scaling Algorithm O(n2 log U

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

View Full Document
Ask a homework question - tutors are online