Main Reference: Sections in CLRS.
|
|
- Winfred Newton
- 5 years ago
- Views:
Transcription
1 Maximum Flow Reied 09/09/200 Main Reference: Secion in CLRS. Inroducion Definiion Muli-Source Muli-Sink The Ford-Fulkeron Mehod Reidual Nework Augmening Pah The Max-Flow Min-Cu Theorem The Edmond-Karp algorihm Max Biparie Maching Odd and End
2 Maximum Flow Main Reference: Secion in CLRS. Gien a direced graph, G = (V, E) : flow nework Source (producer) and deinaion. Inernal Node are warehoue Edge co are capaciie Maximum amoun ha can be hipped oer edge All good hipped ino a warehoue mu leae he warehoue Goal: Ship Maximum amoun (flow) from o. 2
3 A Flow Nework wih capaciie /6 0 / 6/2 /9 6/7 8/20 6/ / 2 9/ A flow wih alue /6 0 / 2/2 /9 7/7 /20 8/ / 2 / A max-flow: alue i 9
4 A flow nework i a graph G = (V, E). Source V,, ink V,. Eery edge (u, ) E ha capaciy, c(u, ) 0. Aume ha for eery V here i a pah from o and from o. A FLOW i a funcion f : V V R aifying: Capaciy Conrain: u,, V, f(u, ) c(u, ). Skew Symmery: u,, V, f(u, ) = f(, u). Flow Coneraion: u V {, }, V f(u, ) = 0. The VALUE of flow i f = V f(, ).. MAXIMUM-FLOW PROBLEM: Gien G, c,,, find f ha maximize f.
5 Muli-Source Muli-Sink Problem The baic Max-Flow problem aume ha here i only one ource, and one ink. Suppoe ha here are muliple ource, 2,..., k and muliple ink, 2,..., l. The definiion of a flow remain he ame excep ha he Flow Coneraion propery now become u V {, 2,..., k,, 2,..., l }, V f(u, ) = 0 and our goal i o maximize f = k i= V f( i, ). Thi problem can be reduced o he original one by inroducing a uperource 0, a uperink 0 and edge i ( 0, i ) and j ( j, 0 ), all of which hae capaciy.
6 A muli-ource muli-ink problem and i equialen ingle-ource ingle-ink erion
7 Manipulaing Flow Le X, Y V. We define f(x, Y ) = x X y Y f(x, y). The flow-coneraion conrain hen ju ay u V {, }, f(u, V ) = 0. Lemma: (Proof in Homework) X V, f(x, X) = 0. X, Y V, f(x, Y ) = f(y, X). X, Y, Z V wih X Y = f(x Y, Z) = f(x, Z) + f(y, Z) and f(z, X Y ) = f(z, X) + f(z, Y ) 7
8 Flow f wa defined a amoun ha leae ource. We now ee ha hi i he ame a amoun ha ener ink.. f = f(, V ) definiion = f(v, V ) f(v, V ) preiou page = f(v, V ) preiou page = f(v, V ) preiou page = f(v, ) + f(v, V ) preiou page = f(v, ) flow coneraion 8
9 In eery opimizaion problem we hae o deal wih he queion: How can we proe ha our oluion i opimal (maximal/minimal)? A common echnique (for max problem) i o find a good upper-bound on he co of an opimal oluion and hen how ha our oluion aifie ha bound. A CUT S, T of G i a pariion of he erice V = S T, S T =, S, and T. The flow acro he cu i f(s, T). The capaciy of a cu i C(S, T) = x S,y T c(x, y). Noe ha for any cu, f(s, T) c(s, T). 9
10 /6 0 / 2/2 /9 7/7 /20 8/ / S T 2 / Cu (S, T): S = {,, 2 }, T = {,, }. The flow alue i f = 9 and C(S, T) = 26. Noe ha F C(S, T). 0
11 Lemma: If S, T i any cu, f any flow hen f C(S, T). Proof: f = f(, V ) = f(, V ) + f(s, V ) = f(s, V ) = f(s, V ) f(s, S) = f(s, V S) = f(s, T) c(s, T) We will now deelop he Ford-Fulkeron mehod for finding max-flow. When FF erminae i proide a flow f and a cu S, T uch ha f = C(S, T), o f i maximal.
12 The Ford-Fulkeron Mehod I ieraie. Sar wih flow f = 0, ( u,, f(u, ) = 0) A each ep Conruc a reidual nework G f of f indicaing how much capaciy remain o be ued. Find an augmening pah - pah p in G f along which flow can be puhed. puhe f uni of flow along p. Creae new flow f = f + f. Sop when here i no - pah in curren G f. Le S be he e of node reachable from in G f and T = V S. A concluion of FF algorihm, f = c(s, T) o f i opimal. 2
13 Reidual nework Gien flow f, he reidual nework G f coni of he edge along which we can (ill) puh more flow. The amoun ha can (ill) be puhed acro(u, ) i called he reidual capaciy c f (u, ). c f (u, ) = c(u, ) f(u, ). If here i flow from u o hen f(u, ) > 0 and c f (u, ) i he remaining capaciy on (u, ). If here i flow from o u hen f(u, ) < 0 and c f (u, ) = c(u, ) + f(, u) i he capaciy of (u, ) plu amoun of exiing flow ha can be puhed backward from u o. The Reidual nework G f i G f = (V, E f ) where E f = { (u, ) V V : c f (u, ) > 0 }
14 /6 0 / 2/2 9 7/7 9/20 2/ / 2 A flow / I reidual nework
15 Lemma: Le f be a flow in G = (V, E) and G f i reidual nework. Le f be a flow in G f. Define f+f a (f+f )(u, ) = f(u, )+f (u, ). Then f + f i a flow in G wih alue f + f = f + f. Augmening pah p i a imple - pah in G f. The reidual capaciy of a.p. p i c f (p) = min{c f (u, ) : (u, ) on p}. Le p be an augmening pah in G f and define f p (u, ) = c f (p) if (u, ) i on p c f (p) if (, u) i on p 0 oherwie Lemma: If f i a flow and p an a.p.in G f hen: f p i a flow in G g wih f p = c f (p) > 0. f = f +f p i a flow in G wih f = f + f p > f.
16 /6 8/ 0 / 2/2 /9 / 2 7/7 /20 / /6 2/ 0 / 2/2 9 / 2 7/7 9/20 / An iniial flow f. I reidual nework G f and an augmening pah f in G f. The flow f + f and i reidual nework. 6
17 Opimaliy Theorem: (Max-Flow Min-Cu Theorem) Le f be a flow. Then he following hree condiion are equialen:. f i a maximum flow in G. 2. G f conain no augmening pah. f = C(S, T) for ome (S, T) cu. Proof: () (2): If G f conained an augmening pah p hen f + f p > f o f could no be maximal. (2) (): Le S = {u V : pah from o in G f }. T = V S. Then f(s, T) = f(s,v ) f(s,s) = f(s, V ) = f(, V )+f(s, V ) = f. Now noe ha u S, T, f(u, ) = c(u, ) ince oherwie c f (u, ) > 0 and S. Thu C(S, T) = f(s, T) = f. () (): We preiouly aw ha eery flow f mu aify f C(S, T) o if f = C(S, T), f mu be opimal. 7
18 The Ford-Fulkeron Mehod Sar wih flow f 0, ( u,, f(u, ) = 0) Conruc reidual nework G f. If G f conain no augmening pah, op (f i opimal by MFMC heorem). Oherwie.. Find an augmening pah ( pah) p in G f 2. Le f p be he flow in G f ha puhe c f (p) uni of flow along p.. Le f = f + f p be new flow in G. 8
19 /6 /2 / / 2 2 / /6 /2 7/0 /9 7/7 7/20 / / /6 2/2 0 / /9 7/7 /20 / 2 8/ 2 / /6 2/ 2/2 0 / 7/7 2 9 / 9/20 /
20 Running Time & Finiene The FF mehod i no a compleely defined algorihm ince i doen pecify how o chooe he augmening pah. In fac, if he capaciie are irraional, i i poible ha a bad way of chooing he a.p. will lead o a nonerminaing algorihm ha will neer op (i will keep on adding cheaper and cheaper augmening pah). See ecion 6. of he PS book for example. If he capaciie are all ineger hen each c p will be an ineger o he algorihm mu erminae afer f ep, where f i a max-flow. Mainaining he graph G and G f and he flow f uing adjacency li while uing DFS or BFS o find a - pah, he algorihm can hen be implemened o run in O( f E ) ime. Noe: Thi can be normalized o work if he capaciie are raional. 20
21 Sar wih flow f 0, O( E ) Conruc reidual nework G f. O( E ) If G f conain no augmening pah, op (f i opimal by MFMC heorem). Oherwie. Can be repeaed O( f ) ime.. Find an augmening pah p in G f O( E ) 2. Le f p be he flow in G f ha puhe c f (p) uni of flow along p.. Le f = f + f p be new flow in G. O( E ) 2
22 A pahological example in which each augmening pah only increae flow alue by uni.,000,000,000,000 u,000,000,000,000,000, ,999 u,000, , , ,999 u 999, , , ,998 u 999, , , ,998 u 999, ,998 22
23 The Edmond-Karp Algorihm Alway chooe an augmening pah of minimum-lengh in G f (where each edge ha uni lengh). Thi can be done in O(E) ime uing BFS. Theorem: The EK alg perform a mo O(V E) pah-augmenaion, o he E.K. alg run in O(V E 2 ) ime. Le δ f (u, ) denoe hore-pah diance from u o in G f. The proof of he Theorem i a conequence of he following wo lemma: Lemma: V {, }, δ f (, ) doe no decreae afer a flow augmenaion. Lemma: Edge (u, ) i criical on a.p. p if c f (u, ) = c f (p). Suppoe when running he E.K. algorihm ha (u, ) i criical for a.p. p in G f, and i laer criical again for anoher a.p. p in G f. Then δ f (, u) δ f (, u)
24 Applicaion: Max Biparie Maching A graph G = (V, E) i biparie if here exi pariion V = L R wih L R = and E L R. A Maching i a ube M E uch ha V a mo one edge in M i inciden upon. The ize of a maching i M, he number of edge in M. A Maximum Maching i maching M uch ha eery oher maching M aifie M M. Problem: Gien biparie graph G, find a maximum maching. 2
25 A biparie graph wih 2 maching L R L R 2
26 Our approach will be o wrie he Max Biparie Maching problem a a Max-Flow problem. Our flow nework will be G = (V, E ) where V = V {, } and E = {(, u) : u L} {(u, ) : u L, R and (u, ) E} {(, ) : R} We alo aign (u, ) E, c(u, ) =. Lemma: If f i an ineger alued flow in G hen here i a maching M of G wih f = M. Similarly, if M i a maching of G hen here i an ineger alued flow f wih f = M. Thi almo ell u ha Max-Flow ole our problem. The difficuly i ha i poible ha he max-flow migh no hae ineger alue (i i poible ha f migh be an ineger bu ome f(u, ) migh no be ineger). 26
27 A biparie graph and i aociaed flow nework. A maching and aociaed flow are illuraed L R L R 27
28 Theorem: Le G = (V, E ) be a flow nework in which c i inegral. Then he max-flow f found by he F.F. mehod ha he propery ha u,, f(u, ) i ineger alued. The proof i by inducion on he ep in he FF mehod. A each ep he curren flow f i ineger o he reidual capaciie are all ineger. Thi implie ha he a.p. found ha c f (p) inegral o he new flow f + f creaed i alo inegral. The heorem guaranee ha if G i he flow nework correponding o a biparie maching problem hen max flow alue f i he alue of a maximum maching. The flow found by he FF algorihm can be modified o yield he max maching. The FF algorihm run on hi pecial graph will ake O(V E) ime (why?). 28
29 Odd and End A faer implemenaion of he FF mehod ue he idea of blocking flow deeloped by Dinic. Thi approach find many augmening pah a once. A oally differen approach o he Max-Flow algorihm i he puh-relabel mehod (ee CLRS for deail). Thi can run in O( V ) ime a comapred o he O( V E 2 ) of FF. We will ee laer ha he max-flow problem can be wrien a a linear program. The FF mehod i eenial a pecial cae of he primal-dual algorihm for oling combinaorial LP. 29
1 Motivation and Basic Definitions
CSCE : Deign and Analyi of Algorihm Noe on Max Flow Fall 20 (Baed on he preenaion in Chaper 26 of Inroducion o Algorihm, 3rd Ed. by Cormen, Leieron, Rive and Sein.) Moivaion and Baic Definiion Conider
More informationGraphs III - Network Flow
Graph III - Nework Flow Flow nework eup graph G=(V,E) edge capaciy w(u,v) 0 - if edge doe no exi, hen w(u,v)=0 pecial verice: ource verex ; ink verex - no edge ino and no edge ou of Aume every verex v
More informationNetwork Flow. Data Structures and Algorithms Andrei Bulatov
Nework Flow Daa Srucure and Algorihm Andrei Bulao Algorihm Nework Flow 24-2 Flow Nework Think of a graph a yem of pipe We ue hi yem o pump waer from he ource o ink Eery pipe/edge ha limied capaciy Flow
More informationAlgorithms and Data Structures 2011/12 Week 9 Solutions (Tues 15th - Fri 18th Nov)
Algorihm and Daa Srucure 2011/ Week Soluion (Tue 15h - Fri 18h No) 1. Queion: e are gien 11/16 / 15/20 8/13 0/ 1/ / 11/1 / / To queion: (a) Find a pair of ube X, Y V uch ha f(x, Y) = f(v X, Y). (b) Find
More informationThe Residual Graph. 12 Augmenting Path Algorithms. Augmenting Path Algorithm. Augmenting Path Algorithm
Augmening Pah Algorihm Greedy-algorihm: ar wih f (e) = everywhere find an - pah wih f (e) < c(e) on every edge augmen flow along he pah repea a long a poible The Reidual Graph From he graph G = (V, E,
More informationMax Flow, Min Cut COS 521. Kevin Wayne Fall Soviet Rail Network, Cuts. Minimum Cut Problem. Flow network.
Sovie Rail Nework, Max Flow, Min u OS Kevin Wayne Fall Reference: On he hiory of he ranporaion and maximum flow problem. lexander Schrijver in Mah Programming, :,. Minimum u Problem u Flow nework.! Digraph
More informationSoviet Rail Network, 1955
Sovie Rail Nework, 1 Reference: On he hiory of he ranporaion and maximum flow problem. Alexander Schrijver in Mah Programming, 1: 3,. Maximum Flow and Minimum Cu Max flow and min cu. Two very rich algorihmic
More informationThe Residual Graph. 11 Augmenting Path Algorithms. Augmenting Path Algorithm. Augmenting Path Algorithm
Augmening Pah Algorihm Greedy-algorihm: ar wih f (e) = everywhere find an - pah wih f (e) < c(e) on every edge augmen flow along he pah repea a long a poible The Reidual Graph From he graph G = (V, E,
More informationFlow networks, flow, maximum flow. Some definitions. Edmonton. Saskatoon Winnipeg. Vancouver Regina. Calgary. 12/12 a.
Flow nework, flow, maximum flow Can inerpre direced graph a flow nework. Maerial coure hrough ome yem from ome ource o ome ink. Source produce maerial a ome eady rae, ink conume a ame rae. Example: waer
More informationFlow networks. Flow Networks. A flow on a network. Flow networks. The maximum-flow problem. Introduction to Algorithms, Lecture 22 December 5, 2001
CS 545 Flow Nework lon Efra Slide courey of Charle Leieron wih mall change by Carola Wenk Flow nework Definiion. flow nework i a direced graph G = (V, E) wih wo diinguihed verice: a ource and a ink. Each
More informationToday: Max Flow Proofs
Today: Max Flow Proof COSC 58, Algorihm March 4, 04 Many of hee lide are adaped from everal online ource Reading Aignmen Today cla: Chaper 6 Reading aignmen for nex cla: Chaper 7 (Amorized analyi) In-Cla
More informationNetwork Flows: Introduction & Maximum Flow
CSC 373 - lgorihm Deign, nalyi, and Complexiy Summer 2016 Lalla Mouaadid Nework Flow: Inroducion & Maximum Flow We now urn our aenion o anoher powerful algorihmic echnique: Local Search. In a local earch
More informationCSC 364S Notes University of Toronto, Spring, The networks we will consider are directed graphs, where each edge has associated with it
CSC 36S Noe Univeriy of Torono, Spring, 2003 Flow Algorihm The nework we will conider are direced graph, where each edge ha aociaed wih i a nonnegaive capaciy. The inuiion i ha if edge (u; v) ha capaciy
More informationMaximum Flow and Minimum Cut
// Sovie Rail Nework, Maximum Flow and Minimum Cu Max flow and min cu. Two very rich algorihmic problem. Cornerone problem in combinaorial opimizaion. Beauiful mahemaical dualiy. Nework Flow Flow nework.
More informationMatching. Slides designed by Kevin Wayne.
Maching Maching. Inpu: undireced graph G = (V, E). M E i a maching if each node appear in a mo edge in M. Max maching: find a max cardinaliy maching. Slide deigned by Kevin Wayne. Biparie Maching Biparie
More information! Abstraction for material flowing through the edges. ! G = (V, E) = directed graph, no parallel edges.
Sovie Rail Nework, haper Nework Flow Slide by Kevin Wayne. opyrigh Pearon-ddion Weley. ll righ reerved. Reference: On he hiory of he ranporaion and maximum flow problem. lexander Schrijver in Mah Programming,
More informationCS4445/9544 Analysis of Algorithms II Solution for Assignment 1
Conider he following flow nework CS444/944 Analyi of Algorihm II Soluion for Aignmen (0 mark) In he following nework a minimum cu ha capaciy 0 Eiher prove ha hi aemen i rue, or how ha i i fale Uing he
More informationCSE 521: Design & Analysis of Algorithms I
CSE 52: Deign & Analyi of Algorihm I Nework Flow Paul Beame Biparie Maching Given: A biparie graph G=(V,E) M E i a maching in G iff no wo edge in M hare a verex Goal: Find a maching M in G of maximum poible
More informationCS 473G Lecture 15: Max-Flow Algorithms and Applications Fall 2005
CS 473G Lecure 1: Max-Flow Algorihm and Applicaion Fall 200 1 Max-Flow Algorihm and Applicaion (November 1) 1.1 Recap Fix a direced graph G = (V, E) ha doe no conain boh an edge u v and i reveral v u,
More informationSoviet Rail Network, 1955
7.1 Nework Flow Sovie Rail Nework, 19 Reerence: On he hiory o he ranporaion and maximum low problem. lexander Schrijver in Mah Programming, 91: 3, 00. (See Exernal Link ) Maximum Flow and Minimum Cu Max
More informationProblem Set If all directed edges in a network have distinct capacities, then there is a unique maximum flow.
CSE 202: Deign and Analyi of Algorihm Winer 2013 Problem Se 3 Inrucor: Kamalika Chaudhuri Due on: Tue. Feb 26, 2013 Inrucion For your proof, you may ue any lower bound, algorihm or daa rucure from he ex
More informationAlgorithmic Discrete Mathematics 6. Exercise Sheet
Algorihmic Dicree Mahemaic. Exercie Shee Deparmen of Mahemaic SS 0 PD Dr. Ulf Lorenz 7. and 8. Juni 0 Dipl.-Mah. David Meffer Verion of June, 0 Groupwork Exercie G (Heap-Sor) Ue Heap-Sor wih a min-heap
More informationAlgorithm Design and Analysis
Algorihm Deign and Analyi LECTURES 17 Nework Flow Dualiy of Max Flow and Min Cu Algorihm: Ford-Fulkeron Capaciy Scaling Sofya Rakhodnikova S. Rakhodnikova; baed on lide by E. Demaine, C. Leieron, A. Smih,
More informationNetwork flows. The problem. c : V V! R + 0 [ f+1g. flow network G = (V, E, c), a source s and a sink t uv not in E implies c(u, v) = 0
Nework flow The problem Seing flow nework G = (V, E, c), a orce and a ink no in E implie c(, ) = 0 Flow from o capaciy conrain kew-ymmery flow-coneraion ale of he flow jfj = P 2V Find a maximm flow from
More informationAlgorithm Design and Analysis
Algorihm Deign and Analyi LECTURE 0 Nework Flow Applicaion Biparie maching Edge-dijoin pah Adam Smih 0//0 A. Smih; baed on lide by E. Demaine, C. Leieron, S. Rakhodnikova, K. Wayne La ime: Ford-Fulkeron
More informationRandomized Perfect Bipartite Matching
Inenive Algorihm Lecure 24 Randomized Perfec Biparie Maching Lecurer: Daniel A. Spielman April 9, 208 24. Inroducion We explain a randomized algorihm by Ahih Goel, Michael Kapralov and Sanjeev Khanna for
More informationMAXIMUM FLOW. introduction Ford-Fulkerson algorithm maxflow-mincut theorem
MAXIMUM FLOW inroducion Ford-Fulkeron algorihm maxflow-mincu heorem Mincu problem Inpu. An edge-weighed digraph, ource verex, and arge verex. each edge ha a poiive capaciy capaciy 9 10 4 15 15 10 5 8 10
More information6/3/2009. CS 244 Algorithm Design Instructor: t Artur Czumaj. Lecture 8 Network flows. Maximum Flow and Minimum Cut. Minimum Cut Problem.
Maximum Flow and Minimum Cu CS lgorihm Deign Inrucor: rur Czumaj Lecure Nework Max and min cu. Two very rich algorihmic problem. Cornerone problem in combinaorial opimizaion. Beauiful mahemaical dualiy.
More informationAdmin MAX FLOW APPLICATIONS. Flow graph/networks. Flow constraints 4/30/13. CS lunch today Grading. in-flow = out-flow for every vertex (except s, t)
/0/ dmin lunch oday rading MX LOW PPLIION 0, pring avid Kauchak low graph/nework low nework direced, weighed graph (V, ) poiive edge weigh indicaing he capaciy (generally, aume ineger) conain a ingle ource
More informationGreedy. I Divide and Conquer. I Dynamic Programming. I Network Flows. Network Flow. I Previous topics: design techniques
Algorihm Deign Technique CS : Nework Flow Dan Sheldon April, reedy Divide and Conquer Dynamic Programming Nework Flow Comparion Nework Flow Previou opic: deign echnique reedy Divide and Conquer Dynamic
More informationCMPS 6610/4610 Fall Flow Networks. Carola Wenk Slides adapted from slides by Charles Leiserson
CMP 6610/4610 Fall 2016 Flow Nework Carola Wenk lide adaped rom lide by Charle Leieron Max low and min c Fndamenal problem in combinaorial opimizaion Daliy beween max low and min c Many applicaion: Biparie
More informationNetwork Flows UPCOPENCOURSEWARE number 34414
Nework Flow UPCOPENCOURSEWARE number Topic : F.-Javier Heredia Thi work i licened under he Creaive Common Aribuion- NonCommercial-NoDeriv. Unpored Licene. To view a copy of hi licene, vii hp://creaivecommon.org/licene/by-nc-nd/./
More information16 Max-Flow Algorithms and Applications
Algorihm A proce canno be underood by opping i. Underanding mu move wih he flow of he proce, mu join i and flow wih i. The Fir Law of Mena, in Frank Herber Dune (196) There a difference beween knowing
More informationThey were originally developed for network problem [Dantzig, Ford, Fulkerson 1956]
6. Inroducion... 6. The primal-dual algorihmn... 6 6. Remark on he primal-dual algorihmn... 7 6. A primal-dual algorihmn for he hore pah problem... 8... 9 6.6 A primal-dual algorihmn for he weighed maching
More information4/12/12. Applications of the Maxflow Problem 7.5 Bipartite Matching. Bipartite Matching. Bipartite Matching. Bipartite matching: the flow network
// Applicaion of he Maxflow Problem. Biparie Maching Biparie Maching Biparie maching. Inpu: undireced, biparie graph = (, E). M E i a maching if each node appear in a mo one edge in M. Max maching: find
More information26.1 Flow networks. f (u,v) = 0.
26 Maimum Flow Ju a we can model a road map a a direced graph in order o find he hore pah from one poin o anoher, we can alo inerpre a direced graph a a flow nework and ue i o anwer queion abou maerial
More information18 Extensions of Maximum Flow
Who are you?" aid Lunkwill, riing angrily from hi ea. Wha do you wan?" I am Majikhie!" announced he older one. And I demand ha I am Vroomfondel!" houed he younger one. Majikhie urned on Vroomfondel. I
More informationMaximum Flow. Contents. Max Flow Network. Maximum Flow and Minimum Cut
Conen Maximum Flow Conen. Maximum low problem. Minimum cu problem. Max-low min-cu heorem. Augmening pah algorihm. Capaciy-caling. Shore augmening pah. Princeon Univeriy COS Theory o Algorihm Spring Kevin
More informationMaximum Flow 5/6/17 21:08. Presentation for use with the textbook, Algorithm Design and Applications, by M. T. Goodrich and R. Tamassia, Wiley, 2015
Maximm Flo 5/6/17 21:08 Preenaion for e ih he exbook, Algorihm Deign and Applicaion, by M. T. Goodrich and R. Tamaia, Wiley, 2015 Maximm Flo χ 4/6 4/7 1/9 2015 Goodrich and Tamaia Maximm Flo 1 Flo Neork
More informationCSE 421 Introduction to Algorithms Winter The Network Flow Problem
CSE 42 Inroducion o Algorihm Winer 202 The Nework Flow Problem 2 The Nework Flow Problem 5 a 4 3 x 3 7 6 b 4 y 4 7 6 c 5 z How much uff can flow from o? 3 Sovie Rail Nework, 955 Reference: On he hiory
More informationIntroduction to Congestion Games
Algorihmic Game Theory, Summer 2017 Inroducion o Congeion Game Lecure 1 (5 page) Inrucor: Thoma Keelheim In hi lecure, we ge o know congeion game, which will be our running example for many concep in game
More informationAlgorithms. Algorithms 6.4 MAXIMUM FLOW
Algorihm ROBERT SEDGEWICK KEVIN WAYNE 6.4 MAXIMUM FLOW Algorihm F O U R T H E D I T I O N ROBERT SEDGEWICK KEVIN WAYNE hp://alg4.c.princeon.edu inroducion Ford Fulkeron algorihm maxflow mincu heorem analyi
More informationMaximum Flow. How do we transport the maximum amount data from source to sink? Some of these slides are adapted from Lecture Notes of Kevin Wayne.
Conen Conen. Maximum flow problem. Minimum cu problem. Max-flow min-cu heorem. Augmening pah algorihm. Capaciy-caling. Shore augmening pah. Chaper Maximum How do we ranpor he maximum amoun daa from ource
More informationPlease Complete Course Survey. CMPSCI 311: Introduction to Algorithms. Approximation Algorithms. Coping With NP-Completeness. Greedy Vertex Cover
Pleae Complee Coure Survey CMPSCI : Inroducion o Algorihm Dealing wih NP-Compleene Dan Sheldon hp: //owl.oi.uma.edu/parner/coureevalsurvey/uma/ Univeriy of Maachue Slide Adaped from Kevin Wayne La Compiled:
More informationReminder: Flow Networks
0/0/204 Ma/CS 6a Cla 4: Variou (Flow) Execie Reminder: Flow Nework A flow nework i a digraph G = V, E, ogeher wih a ource verex V, a ink verex V, and a capaciy funcion c: E N. Capaciy Source 7 a b c d
More information6.8 Laplace Transform: General Formulas
48 HAP. 6 Laplace Tranform 6.8 Laplace Tranform: General Formula Formula Name, ommen Sec. F() l{ f ()} e f () d f () l {F()} Definiion of Tranform Invere Tranform 6. l{af () bg()} al{f ()} bl{g()} Lineariy
More informationFlow Networks. Ma/CS 6a. Class 14: Flow Exercises
0/0/206 Ma/CS 6a Cla 4: Flow Exercie Flow Nework A flow nework i a digraph G = V, E, ogeher wih a ource verex V, a ink verex V, and a capaciy funcion c: E N. Capaciy Source 7 a b c d e Sink 0/0/206 Flow
More informationApril 3, The maximum flow problem. See class notes on website.
5.05 April, 007 The maximum flow problem See cla noe on webie. Quoe of he day You ge he maxx for he minimum a TJ Maxx. -- ad for a clohing ore Thi wa he mo unkinde cu of all -- Shakepeare in Juliu Caear
More informationIntroduction to SLE Lecture Notes
Inroducion o SLE Lecure Noe May 13, 16 - The goal of hi ecion i o find a ufficien condiion of λ for he hull K o be generaed by a imple cure. I urn ou if λ 1 < 4 hen K i generaed by a imple curve. We will
More information7. NETWORK FLOW I. Lecture slides by Kevin Wayne Copyright 2005 Pearson-Addison Wesley. Last updated on 11/22/17 6:11 AM
7. NETWORK FLOW I max-flow and min-cu problem Ford Fulkeron algorihm max-flow min-cu heorem capaciy-caling algorihm hore augmening pah blocking-flow algorihm imple uni-capaciy nework Lecure lide by Kevin
More informationBasic Tools CMSC 641. Running Time. Problem. Problem. Algorithmic Design Paradigms. lg (n!) (lg n)! (lg n) lgn n.2
Baic Tool CMSC April, Review Aympoic Noaion Order of Growh Recurrence relaion Daa Srucure Li, Heap, Graph, Tree, Balanced Tree, Hah Table Advanced daa rucure: Binomial Heap, Fibonacci Heap Soring Mehod
More informationCS261: A Second Course in Algorithms Lecture #1: Course Goals and Introduction to Maximum Flow
CS61: A Second Coure in Algorihm Lecure #1: Coure Goal and Inroducion o Maximum Flo Tim Roughgarden January 5, 016 1 Coure Goal CS61 ha o major coure goal, and he coure pli roughly in half along hee line.
More information23 Maximum Flows and Minimum Cuts
A proce canno be underood by opping i. Underanding mu move wih he flow of he proce, mu join i and flow wih i. The Fir Law of Mena, in Frank Herber Dune (196) Conrary o expecaion, flow uually happen no
More informationLaplace Transform. Inverse Laplace Transform. e st f(t)dt. (2)
Laplace Tranform Maoud Malek The Laplace ranform i an inegral ranform named in honor of mahemaician and aronomer Pierre-Simon Laplace, who ued he ranform in hi work on probabiliy heory. I i a powerful
More information7. NETWORK FLOW I. Lecture slides by Kevin Wayne Copyright 2005 Pearson-Addison Wesley. Last updated on 11/22/17 6:11 AM
7. NETWORK FLOW I max-flow and min-cu problem Ford Fulkeron algorihm max-flow min-cu heorem capaciy-caling algorihm hore augmening pah blocking-flow algorihm imple uni-capaciy nework Lecure lide by Kevin
More information7.5 Bipartite Matching. Chapter 7. Network Flow. Matching. Bipartite Matching
Chaper. Biparie Maching Nework Flow Slide by Kein Wayne. Copyrigh 00 Pearon-Addion Weley. All righ reered. Maching Biparie Maching Maching. Inpu: undireced graph G = (V, E). M E i a maching if each node
More information3/3/2015. Chapter 7. Network Flow. Maximum Flow and Minimum Cut. Minimum Cut Problem
// Chaper Nework Flow Maximum Flow and Minimum Cu Max flow and min cu. Two very rich algorihmic problem. Cornerone problem in combinaorial opimizaion. Beauiful mahemaical dualiy. Nonrivial applicaion /
More informationMaximum Flow in Planar Graphs
Maximum Flow in Planar Graph Planar Graph and i Dual Dualiy i defined for direced planar graph a well Minimum - cu in undireced planar graph An - cu (undireced graph) An - cu The dual o he cu Cu/Cycle
More informationMaximum Flow 3/3 4/6 1/1 4/7 3/3. s 3/5 1/9 1/1 3/5 2/2. 1/18/2005 4:03 AM Maximum Flow 1
Maximm Flo χ 4/6 4/7 1/9 8/2005 4:03 AM Maximm Flo 1 Oline and Reading Flo neork Flo ( 8.1.1) C ( 8.1.2) Maximm flo Agmening pah ( 8.2.1) Maximm flo and minimm c ( 8.2.1) Ford-Flkeron algorihm ( 8.2.2-8.2.3)
More informationSelfish Routing. Tim Roughgarden Cornell University. Includes joint work with Éva Tardos
Selfih Rouing Tim Roughgarden Cornell Univeriy Include join work wih Éva Tardo 1 Which roue would you chooe? Example: one uni of raffic (e.g., car) wan o go from o delay = 1 hour (no congeion effec) long
More informationAverage Case Lower Bounds for Monotone Switching Networks
Average Cae Lower Bound for Monoone Swiching Nework Yuval Filmu, Toniann Piai, Rober Robere, Sephen Cook Deparmen of Compuer Science Univeriy of Torono Monoone Compuaion (Refreher) Monoone circui were
More informationThe Primal Simplex Approach to the QoS Routing Problem
The Primal Simplex Approach o he QoS Rouing Problem Ying Xiao, Krihnaiyan Thulairaman Univeriy of Oklahoma, Norman, OK {ying_xiao, hulai}@ou.edu Guoliang Xue Arizona Sae Univeriy, Tempe, AZ xue@au.edu
More informationExponential Sawtooth
ECPE 36 HOMEWORK 3: PROPERTIES OF THE FOURIER TRANSFORM SOLUTION. Exponenial Sawooh: The eaie way o do hi problem i o look a he Fourier ranform of a ingle exponenial funcion, () = exp( )u(). From he able
More information, the. L and the L. x x. max. i n. It is easy to show that these two norms satisfy the following relation: x x n x = (17.3) max
ecure 8 7. Sabiliy Analyi For an n dimenional vecor R n, he and he vecor norm are defined a: = T = i n i (7.) I i eay o how ha hee wo norm aify he following relaion: n (7.) If a vecor i ime-dependen, hen
More informationToday s topics. CSE 421 Algorithms. Problem Reduction Examples. Problem Reduction. Undirected Network Flow. Bipartite Matching. Problem Reductions
Today opic CSE Algorihm Richard Anderon Lecure Nework Flow Applicaion Prolem Reducion Undireced Flow o Flow Biparie Maching Dijoin Pah Prolem Circulaion Loweround conrain on flow Survey deign Prolem Reducion
More informationCHAPTER 7: SECOND-ORDER CIRCUITS
EEE5: CI RCUI T THEORY CHAPTER 7: SECOND-ORDER CIRCUITS 7. Inroducion Thi chaper conider circui wih wo orage elemen. Known a econd-order circui becaue heir repone are decribed by differenial equaion ha
More informationNetwork Flow Applications
Hopial problem Neork Flo Applicaion Injured people: n Hopial: k Each peron need o be brough o a hopial no more han 30 minue aay Each hopial rea no more han n/k" people Gien n, k, and informaion abou people
More informationLecture 26. Lucas and Stokey: Optimal Monetary and Fiscal Policy in an Economy without Capital (JME 1983) t t
Lecure 6. Luca and Sokey: Opimal Moneary and Fical Policy in an Economy wihou Capial (JME 983. A argued in Kydland and Preco (JPE 977, Opimal governmen policy i likely o be ime inconien. Fiher (JEDC 98
More informationEECE 301 Signals & Systems Prof. Mark Fowler
EECE 31 Signal & Syem Prof. Mark Fowler Noe Se #27 C-T Syem: Laplace Tranform Power Tool for yem analyi Reading Aignmen: Secion 6.1 6.3 of Kamen and Heck 1/18 Coure Flow Diagram The arrow here how concepual
More informationStability in Distribution for Backward Uncertain Differential Equation
Sabiliy in Diribuion for Backward Uncerain Differenial Equaion Yuhong Sheng 1, Dan A. Ralecu 2 1. College of Mahemaical and Syem Science, Xinjiang Univeriy, Urumqi 8346, China heng-yh12@mail.inghua.edu.cn
More information20/20 20/20 0/5 0/5 20/20 20/20 5/5 0/5 0/5 5/5 0/20 25/30 20/20 30/30 20/20 0/5 5/5 20/20 0/5 0/5 15/20 15/25 20/20 10/10
Annoncemen CSEP Applied Algorihm Richard Anderon Lecre 9 Nework Flow Applicaion Reading for hi week 7.-7.. Nework flow applicaion Nex week: Chaper 8. NP-Compleene Final exam, March 8, 6:0 pm. A UW. hor
More informationGraph Theory: Network Flow
Univeriy of Wahingon Mah 336 Term Paper Graph Theory: Nework Flow Auhor: Ellio Broard Advier: Dr. Jame Morrow 3 June 200 Conen Inroducion...................................... 2 2 Terminology......................................
More informationFord Fulkerson algorithm max-flow min-cut theorem. max-flow min-cut theorem capacity-scaling algorithm
7. NETWORK FLOW I 7. NETWORK FLOW I max-flow and min-cu problem max-flow and min-cu problem Ford Fulkeron algorihm Ford Fulkeron algorihm max-flow min-cu heorem max-flow min-cu heorem capaciy-caling algorihm
More informationSelfish Routing and the Price of Anarchy. Tim Roughgarden Cornell University
Selfih Rouing and he Price of Anarchy Tim Roughgarden Cornell Univeriy 1 Algorihm for Self-Inereed Agen Our focu: problem in which muliple agen (people, compuer, ec.) inerac Moivaion: he Inerne decenralized
More informationTP B.2 Rolling resistance, spin resistance, and "ball turn"
echnical proof TP B. olling reiance, pin reiance, and "ball urn" upporing: The Illuraed Principle of Pool and Billiard hp://billiard.coloae.edu by Daid G. Alciaore, PhD, PE ("Dr. Dae") echnical proof originally
More information16 Max-Flow Algorithms
A process canno be undersood by sopping i. Undersanding mus move wih he flow of he process, mus join i and flow wih i. The Firs Law of Mena, in Frank Herber s Dune (196) There s a difference beween knowing
More informationintroduction Ford-Fulkerson algorithm
Algorihm ROBERT SEDGEWICK KEVIN WAYNE. MAXIMUM FLOW. MAXIMUM FLOW inroducion inroducion Ford-Fulkeron algorihm Ford-Fulkeron algorihm Algorihm F O U R T H E D I T I O N maxflow-mincu heorem analyi of running
More informationu(t) Figure 1. Open loop control system
Open loop conrol v cloed loop feedbac conrol The nex wo figure preen he rucure of open loop and feedbac conrol yem Figure how an open loop conrol yem whoe funcion i o caue he oupu y o follow he reference
More informationFord-Fulkerson Algorithm for Maximum Flow
Ford-Fulkerson Algorihm for Maximum Flow 1. Assign an iniial flow f ij (for insance, f ij =0) for all edges.label s by Ø. Mark he oher verices "unlabeled.". Find a labeled verex i ha has no ye been scanned.
More informationWrap up: Weighted, directed graph shortest path Minimum Spanning Tree. Feb 25, 2019 CSCI211 - Sprenkle
Objecive Wrap up: Weighed, direced graph hore pah Minimum Spanning Tree eb, 1 SI - Sprenkle 1 Review Wha are greedy algorihm? Wha i our emplae for olving hem? Review he la problem we were working on: Single-ource,
More informationPrice of Stability and Introduction to Mechanism Design
Algorihmic Game Theory Summer 2017, Week 5 ETH Zürich Price of Sabiliy and Inroducion o Mechanim Deign Paolo Penna Thi i he lecure where we ar deigning yem which involve elfih player. Roughly peaking,
More informationMath 2142 Exam 1 Review Problems. x 2 + f (0) 3! for the 3rd Taylor polynomial at x = 0. To calculate the various quantities:
Mah 4 Eam Review Problems Problem. Calculae he 3rd Taylor polynomial for arcsin a =. Soluion. Le f() = arcsin. For his problem, we use he formula f() + f () + f ()! + f () 3! for he 3rd Taylor polynomial
More informationintroduction Ford-Fulkerson algorithm
Algorihm ROBERT SEDGEWICK KEVIN WAYNE. MAXIMUM FLOW. MAXIMUM FLOW inroducion inroducion Ford-Fulkeron algorihm Ford-Fulkeron algorihm Algorihm F O U R T H E D I T I O N maxflow-mincu heorem analyi of running
More informationTopics in Combinatorial Optimization May 11, Lecture 22
8.997 Topics in Combinaorial Opimizaion May, 004 Lecure Lecurer: Michel X. Goemans Scribe: Alanha Newman Muliflows an Disjoin Pahs Le G = (V,E) be a graph an le s,,s,,...s, V be erminals. Our goal is o
More informationWarm Up. Correct order: s,u,v,y,x,w,t
Warm Up Rn Breadh Fir Search on hi graph aring from. Wha order are erice placed on he qee? When proceing a erex iner neighbor in alphabeical order. In a direced graph, BFS only follow an edge in he direcion
More information23.5. Half-Range Series. Introduction. Prerequisites. Learning Outcomes
Half-Range Series 2.5 Inroducion In his Secion we address he following problem: Can we find a Fourier series expansion of a funcion defined over a finie inerval? Of course we recognise ha such a funcion
More informationTemporal Logic Replication for Dynamically Reconfigurable FPGA Partitioning
Temporal Logic Replicaion for Dynamically Reconfigurable FPGA Pariioning Wai-Kei Mak Dep. of Compuer Science and Engineering Unieriy of Souh Florida Tampa, Florida 620-599 wkmak@cee.uf.edu Eangeline F.Y.
More informationBasic Circuit Elements Professor J R Lucas November 2001
Basic Circui Elemens - J ucas An elecrical circui is an inerconnecion of circui elemens. These circui elemens can be caegorised ino wo ypes, namely acive and passive elemens. Some Definiions/explanaions
More informationExplicit form of global solution to stochastic logistic differential equation and related topics
SAISICS, OPIMIZAION AND INFOMAION COMPUING Sa., Opim. Inf. Compu., Vol. 5, March 17, pp 58 64. Publihed online in Inernaional Academic Pre (www.iapre.org) Explici form of global oluion o ochaic logiic
More informationCHAPTER 6: FIRST-ORDER CIRCUITS
EEE5: CI CUI T THEOY CHAPTE 6: FIST-ODE CICUITS 6. Inroducion This chaper considers L and C circuis. Applying he Kirshoff s law o C and L circuis produces differenial equaions. The differenial equaions
More informationSyntactic Complexity of Suffix-Free Languages. Marek Szykuła
Inroducion Upper Bound on Synacic Complexiy of Suffix-Free Language Univeriy of Wrocław, Poland Join work wih Januz Brzozowki Univeriy of Waerloo, Canada DCFS, 25.06.2015 Abrac Inroducion Sae and ynacic
More information7.5 Bipartite Matching. Chapter 7. Network Flow. Matching. Bipartite Matching
Chaper. Biparie Maching Nework Flow Slide by Kevin Wayne. Copyrigh PearonAddion Weley. All righ reerved. Maching Biparie Maching Maching. Inpu: undireced graph G = (V, E). M E i a maching if each node
More informationSurvivable Routing Meets Diversity Coding
Survivable Rouing Mee Diveriy Coding Alija Pašić, Jáno Tapolcai, Péer Babarczi, Erika R. Bérczi-Kovác, Zolán Király, Lajo Rónyai MTA-BME Fuure Inerne Reearch Group, Budape Univeriy of Technology and Economic
More informationRectilinear Kinematics
Recilinear Kinemaic Coninuou Moion Sir Iaac Newon Leonard Euler Oeriew Kinemaic Coninuou Moion Erraic Moion Michael Schumacher. 7-ime Formula 1 World Champion Kinemaic The objecie of kinemaic i o characerize
More informationCMU-Q Lecture 3: Search algorithms: Informed. Teacher: Gianni A. Di Caro
CMU-Q 5-38 Lecure 3: Search algorihms: Informed Teacher: Gianni A. Di Caro UNINFORMED VS. INFORMED SEARCH Sraegy How desirable is o be in a cerain inermediae sae for he sake of (effecively) reaching a
More informationEfficient Algorithms for Computing Disjoint QoS Paths
Efficien Algorihm for Compuing Dijoin QoS Pah Ariel Orda and Alexander Sprinon 1 Deparmen of Elecrical Engineering, Technion Irael Iniue of Technology, Haifa, Irael 32000 Email: ariel@eeechnionacil Parallel
More information18.03SC Unit 3 Practice Exam and Solutions
Sudy Guide on Sep, Dela, Convoluion, Laplace You can hink of he ep funcion u() a any nice mooh funcion which i for < a and for > a, where a i a poiive number which i much maller han any ime cale we care
More informationDesigning Information Devices and Systems I Spring 2019 Lecture Notes Note 17
EES 16A Designing Informaion Devices and Sysems I Spring 019 Lecure Noes Noe 17 17.1 apaciive ouchscreen In he las noe, we saw ha a capacior consiss of wo pieces on conducive maerial separaed by a nonconducive
More informationFlow Network. The following figure shows an example of a flow network:
Maximum Flow 1 Flow Network The following figure shows an example of a flow network: 16 V 1 12 V 3 20 s 10 4 9 7 t 13 4 V 2 V 4 14 A flow network G = (V,E) is a directed graph. Each edge (u, v) E has a
More information