1 Motivation and Basic Definitions
|
|
- Francine Hoover
- 5 years ago
- Views:
Transcription
1 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 applicaion ha need o model maerial flowing hrough a nework, e.g.: liquid in pipe par in an aembly line curren in an elecrical nework informaion in a communicaion nework In all cae, we wan o find he greae rae of hipmen. Define a flow nework like hi: direced graph G = (V, E) if (u, v) i in E, hen (v, u) i no in E diinguihed verice (ource) and (ink) in V each verex i on ome pah each edge (u, v) E ha a capaciy c(u, v) 0 Example: v A flow in G i a funcion f : V V R aifying hee wo condiion:. capaciy conrain: for all u, v V, 0 f(u, v) c(u, v) (o if (u, v) i no in E, hen f(u, v) mu be 0)
2 2. flow conervaion: For all u V oher han and, f(v, u) = f(u, v) v V v V. The value of flow f, denoed f, i he value of all he flow going ou of he ource minu he value of any flow going ino he ource. (So far, we have no flow going ino he ource, bu laer hi will change.) In mahemaical erm: f = v V f(, v) v V f(v, ). The maximum flow problem i, given a flow nework, o find a flow wih maximum value. Example of a flow (noaion i flow/capaciy on each edge) i given nex; noe ha he value of he flow i + 8 = 9. /6 v 2/2 5/20 / /9 7/7 8/3 / / 2 Ford-Fulkeron Mehod Ford-Fulkeron mehod o find maximum flow ieraively increae he value of he flow, aring wih nohing. iniialize flow f o all 0 while here i an "augmening pah" p in he "reidual nework" G_f augmen flow f along p reurn f Sep : Conruc reidual nework. The reidual capaciy of any pair of verice u and v, denoed c f (u, v), i: c(u, v) f(u, v) if (u, v) E c f (u, v) = f(v, u) if (v, u) E (allow decreaing flow on (u, v)) 0 oherwie The reidual nework G f of G w.r.. flow f i he graph (V, E f ) wih he ame verice a G bu poenially differen edge: E f = {(u, v) V V : c f (u, v) > 0}. Noe ha E f 2 E. 2
3 The reidual nework i very imilar o a flow nework excep ha i can have ani-parallel edge (i.e., boh (u, v) and (v, u)). Sep 2: Find an augmening pah. An augmening pah p i a imple pah (no cycle) from o in he reidual nework G f. Such a pah can be found by, ay, breadh-fir-earch or deph-fir earch. Define a flow in G f ha goe along he augmening pah p and whoe value i he malle capaciy of any edge in he pah (he boleneck). I.e., le and define flow f p like hi: c f (p) = min{c f (u, v) : (u, v) i on p}. f p (u, v) = { cf (p) if (u, v) i on p 0 oherwie Claim (Lemma 26.2): f p i a flow in G f wih value c f (p) > 0. Sep 3: Augmen original flow. Now augmen he original flow f in G uing he new flow f p in G f. Thi combinaion of flow i denoed (f f p ), and defined like hi: { f(u, v) + fp (u, v) f (f f p )(u, v) = p (v, u) if (u, v) E 0 if (u, v) i no in E. Claim (Lemma 26. and Corollary 26.3): (f f p ) i a flow in G wih value f + f p > f. I.e., we have increaed he flow in G! Example: Reidual nework for flow given in previou figure. v An augmening pah in he picure above i ; boleneck capaciy i, from he edge (, ). Afer augmening he original flow wih hi flow, we ge hi new flow (noe ha he new flow ha value + 2 = 23): /6 v 2/2 9/20 / 0/9 7/7 2/3 / / 3
4 3 The Max-Flow Theorem How do we know ha when Ford-Fulkeron op we have found he maximum flow? We need ome mahemaical definiion and reul o how hi. A cu (S, T ) of a flow nework G = (V, E) i a pariion of V ino S and T = V S uch ha S and T. The ne flow acro cu (S, T ) i denoed f(s, T ) and i he um of he flow for all pair from S o T, minu he um of he flow for all pair from T o S, i.e., f(s, T ) = f(u, v) f(v, u). The capaciy of cu(s, T ) i denoed c(s, T ) and i he um of he capaciie for all pair from S o T, i.e., c(s, T ) = c(u, v). Example of a cu; S = {, v, } and T = {,, }: /6 v 2/2 5/20 / /9 7/7 8/3 / / The ne flow acro hi cu i 2 + = 9. The capaciy of hi cu i 2 + = 26. Claim (Lemma 26.): If G ha flow f and cu (S, T ), hen he ne flow acro (S, T ) i f. The proof i baed on ome ideniie for manipulaing flow and cu. The inuiion i ha everyhing in he flow f ha o cro from S o T omewhere. Claim (Corollary 26.5): The value of he maximum flow i a mo he minimum capaciy of any cu. So we can never ge a flow ha i beer han he capaciy of he minimum cu. Ex: The cu S = {, v,, }, T = {, } ha capaciy 23. So we have found he large poible flow. You can check ha here i no cu wih maller capaciy. The main reul, hown nex, i ha hi upper bound can alway be achieved. Max-flow min-cu Theorem (26.6): If f i a flow in G, hen he following are eiher all rue or all fale:. f i a maximum flow in G. 2. G f ha no augmening pah. 3. f = c(s, T ) for ome cu (S, T ) of G.
5 Proof: Show implie 2: If f i a max flow and G f ha an augmening pah p, hen (f f p ) i a larger flow for G, conradicion. Show 2 implie 3: Suppoe G f ha no augmening pah. We ll define a cu wih he deired propery ha i capaciy i he value of he flow f. Le S = {v V : here exi an v pah in G f }. Le T = V S. Why i hi a cu? Obviouly S. Alo T ince here i no pah in G f becaue G f ha no augmening pah. So i i a cu. We now how ha he capaciy of hi cu i f. f = f(s, T ) by Lemma 26. = f(u, v) f(v, u) by definiion of flow acro a cu = (f(u, v) f(v, u)) by algebra = c(u, v) explained nex = c(s, T ) by definiion of capaciy of a cu For he fourh ep above, conider any u S and any v T. Cae : Suppoe (u, v) E. Then f(u, v) = c(u, v), oherwie here would be reidual capaciy on ha edge and u and v would no be on oppoie ide of he cu. Since (v, u) / E, f(v, u) = 0. Thu f(u, v) f(v, u) = c(u, v) 0 = c(u, v). Cae 2: Suppoe (v, u) E. Since u and v are on oppoie ide of he cu, (u, v) / G f, and hu he reidual capaciy on (u, v) i 0. By definiion of G f, he reidual capaciy on (u, v) i f(v, u). Thu f(v, u) = 0. On he oher hand, ince (u, v) / E (by aumpion on original flow nework), boh f(u, v) and c(u, v) are 0. Cae 3: Neiher (u, v) nor (v, u) i in E. Then f(u, v), f(v, u), and c(u, v) are all 0. Show 3 implie : Suppoe f = c(s, T ). By Claim above (Corollary 26.5), f c(s, T ) for every cu (S, T ). So (S, T ) mu be a malle capaciy cu, and hu f i a maximum flow. Inaniaing he Ford-Fulkeron Mehod: Edmond-Karp Now le look a he Ford-Fulkeron mehod in more deail. (I a mehod and no an algorihm ince no all he deail are pelled ou.) Aume f(u, v) i alway 0 if (u, v) i no in E. f(u,v) := 0 for each (u,v) in E while here i an -> pah p in G_f do exra := min {c_f(u,v) : (u,v) i in p} for each (u,v) in p do if (u,v) i in E hen f(u,v) := f(u,v) + exra ele f(v,u) := f(v,u) - exra endif endfor endwhile See Figure 26.6 on pp for example execuion. 5 // deail miing here
6 Baic mehod o find augmening pah: Keep a daa rucure repreening G = (V, E ), where E = {(u, v) : (u, v) E or (v, u) E}. Mainain capaciie and flow on he edge of G. To produce G f from hi daa rucure, include all edge (u, v) in E uch ha c f (u, v) > 0. Find any pah in G f by running DFS or BFS aring a. If we allow any equence of choice for he augmening pah, he algorihm can fail o converge if he capaciie are irraional number. However, if all capaciie are ineger (or raional), hen any equence of choice for he augmening pah will work, alhough he running ime migh be bad. Running Time: Iniializaion ake O(E) ime. Each ieraion of he while loop ake O(E ) = O(E) ime o find augmening pah, and O(E) ime o find minimum reidual capaciy and adju he flow. Number of ieraion of he while loop: The flow alway increae by a lea ince capaciie are ineger. So he number of ieraion i a mo f, where f i he flow found by he algorihm (he maximum flow). Thu he ime i O(E f ). Thi running ime can be errible. Suppoe V and E are mall bu he capaciie are very large. Example of bad running ime for Ford-Fulkeron: Keep alernaing beween uing augmening pah u v and augmening pah v u. Thi will caue he flow o be incremened by a every ieraion, requiring wo million ieraion.,000,000 u,000,000,000,000 v,000,000 To improve, we have he Edmond-Karp algorihm: Alway chooe he augmening pah o be he hore pah, in erm of he number of edge. Do hi uing BFS. Check ha he previou bad example canno occur now. Running ime of Edmond-Karp: Claim (Theorem 26.8): The oal number of augmenaion i O(V E). The idea for proving he claim i ha each augmenaion ha a criical edge, he edge on he augmening pah wih minimum reidual capaciy. I can be hown ha each edge in he graph can only be criical in O(V ) differen augmenaion. So he oal number of augmenaion i O(V E). Uing he claim, ince each augmenaion ake O(E) ime, we ge a oal ime for Edmond- Karp of O(V E 2 ). 6
7 5 Applicaion: Maximum Maching in a Biparie Graph An undireced graph G = (V, E) i biparie if V can be pariioned ino wo e, L and R, uch ha all edge in E go beween L and R. Example of a biparie graph (L coni of verice on he lef, R of hoe on he righ): v 0 v v 5 v 6 A maching of an undireced graph G = (V, E) i a ube of edge uch ha each verex i an endpoin of a mo one edge in he ube. Example: The hick dark edge in he picure below form a maching. v 0 v v 5 v 6 A maximum maching i a maching wih he large poible number of edge. 7
8 Example: Add he edge {v, } in he picure above. A pracical applicaion of finding a maximum maching in a biparie graph i a follow. Le L be a e of machine, each of which can perform one ak. Le R be a e of ak. A paricular machine i only capable of performing cerain ak. Thi can be capured by a biparie graph G = (V, E) in which V = L R, and (u, v) i in E if and only if machine u i capable of performing ak v. We wan o do a many ak a poible a one ime. Such an opimal aignmen of ak o machine would correpond o a maximum maching in G. We can ranform he problem of finding a maximum maching in a biparie graph ino he max-flow problem! Take he maching problem, conver i ino an inance of he max-flow problem, olve he max-flow inance, and hen conver he max-flow oluion o a oluion o he maching problem. In more deail: Given an undireced biparie graph G = (V, E), wih V G = (V, E ) like hi: V = V {, } (new verice for ource and ink) E coni of edge: from o every verex in L from every verex in R o edge in E direced from L o R Aign each edge capaciy. Example: Here i he flow nework for he biparie graph given above. = L R, define a flow nework v 0 v v 5 v 6 And here i a maximum flow for he example. The maximum maching for he original graph coni of he hick dark edge in he middle column (hoe wih poiive flow). 8
9 v 0 / / 0/ 0/ / 0/ v v 5 / / / / / 0/ 0/ v 6 / Lemma (26.9): () If M i a maching in G, hen here i an ineger-valued flow f in G wih f = M. (Inegervalued mean he flow on every edge i an ineger.) (2) If f i an ineger-valued flow in G, hen here i a maching M in G wih M = f. Proof: If a verex v i an endpoin of an edge in a maching M, we ay ha v i in M. () Suppoe M i a maching in G. Define flow f in G o be for all edge from o any verex in M, from any verex in M o, and correponding o an edge in M. The remaining flow are 0. Thi i an ineger-valued flow and he value of he flow i he number of edge in he maching. (2) Suppoe f i an ineger-valued flow in G. Define M o be {(u, v) : u L, v R, f(u, v) > 0}. To how M i a maching, we mu how no verex in L ha wo ougoing edge wih poiive flow, and no verex in R ha wo incoming edge wih poiive flow. For L: verex u in L ha only one incoming edge (from ) and i ha capaciy. Since f i ineger-valued, he flow on (, u) i eiher 0 or. If he flow on (, u) i 0, hen no flow leave u. If he flow on (, u) i, hen exacly one edge ougoing from u ha poiive flow, and i ha flow, ince f i ineger-valued. The argumen for R i imilar. Finally, we mu how M = f. Conider he cu in which S = {} L and T = {} R. By Lemma 26., he ne flow acro hi cu i f (he value of he enire flow). Since he flow i ineger-valued, every edge croing hi cu i aigned flow eiher 0 or. Thu he number of edge croing hi cu wih flow i equal o boh f and o M. Thu if we can find a max flow in G, we will have a maximum maching in G, a long a he maximum flow i ineger-valued. Theorem 26.0 ae ha Ford-Fulkeron produce an inegervalued flow; he proof i an exercie. Finally, Corollary 26. combine hee wo reul (Lemma 26.9 and Theorem 26.0) o conclude ha he cardinaliy of a maximum maching in a biparie graph equal he value of a maximum flow in he flow nework correponding o he graph. 9
Graphs 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 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 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 informationMain Reference: Sections in CLRS.
Maximum Flow Reied 09/09/200 Main Reference: Secion 26.-26. 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
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 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 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 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 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. 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 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 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 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 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 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 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 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 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 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 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 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 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 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 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 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 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 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 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 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 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 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 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 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 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 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 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 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 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 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 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 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 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 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 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 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 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 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 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 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 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 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 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 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 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 information2. VECTORS. R Vectors are denoted by bold-face characters such as R, V, etc. The magnitude of a vector, such as R, is denoted as R, R, V
ME 352 VETS 2. VETS Vecor algebra form he mahemaical foundaion for kinemaic and dnamic. Geomer of moion i a he hear of boh he kinemaic and dnamic of mechanical em. Vecor anali i he imehonored ool for decribing
More informationTo become more mathematically correct, Circuit equations are Algebraic Differential equations. from KVL, KCL from the constitutive relationship
Laplace Tranform (Lin & DeCarlo: Ch 3) ENSC30 Elecric Circui II The Laplace ranform i an inegral ranformaion. I ranform: f ( ) F( ) ime variable complex variable From Euler > Lagrange > Laplace. Hence,
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 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 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 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 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 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 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 informationChapter 7: Inverse-Response Systems
Chaper 7: Invere-Repone Syem Normal Syem Invere-Repone Syem Baic Sar ou in he wrong direcion End up in he original eady-ae gain value Two or more yem wih differen magniude and cale in parallel Main yem
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 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 informationPhysics 240: Worksheet 16 Name
Phyic 4: Workhee 16 Nae Non-unifor circular oion Each of hee proble involve non-unifor circular oion wih a conan α. (1) Obain each of he equaion of oion for non-unifor circular oion under a conan acceleraion,
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 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 informationInventory Analysis and Management. Multi-Period Stochastic Models: Optimality of (s, S) Policy for K-Convex Objective Functions
Muli-Period Sochasic Models: Opimali of (s, S) Polic for -Convex Objecive Funcions Consider a seing similar o he N-sage newsvendor problem excep ha now here is a fixed re-ordering cos (> 0) for each (re-)order.
More informationNotes on cointegration of real interest rates and real exchange rates. ρ (2)
Noe on coinegraion of real inere rae and real exchange rae Charle ngel, Univeriy of Wiconin Le me ar wih he obervaion ha while he lieraure (mo prominenly Meee and Rogoff (988) and dion and Paul (993))
More informationNECESSARY AND SUFFICIENT CONDITIONS FOR LATENT SEPARABILITY
NECESSARY AND SUFFICIENT CONDITIONS FOR LATENT SEPARABILITY Ian Crawford THE INSTITUTE FOR FISCAL STUDIES DEPARTMENT OF ECONOMICS, UCL cemmap working paper CWP02/04 Neceary and Sufficien Condiion for Laen
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 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 informationChapter 9 - The Laplace Transform
Chaper 9 - The Laplace Tranform Selece Soluion. Skech he pole-zero plo an region of convergence (if i exi) for hee ignal. ω [] () 8 (a) x e u = 8 ROC σ ( ) 3 (b) x e co π u ω [] ( ) () (c) x e u e u ROC
More informationSample Final Exam (finals03) Covering Chapters 1-9 of Fundamentals of Signals & Systems
Sample Final Exam Covering Chaper 9 (final04) Sample Final Exam (final03) Covering Chaper 9 of Fundamenal of Signal & Syem Problem (0 mar) Conider he caual opamp circui iniially a re depiced below. I LI
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 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 informationarxiv: v1 [cs.cg] 21 Mar 2013
On he rech facor of he Thea-4 graph Lui Barba Proenji Boe Jean-Lou De Carufel André van Renen Sander Verdoncho arxiv:1303.5473v1 [c.cg] 21 Mar 2013 Abrac In hi paper we how ha he θ-graph wih 4 cone ha
More informationNotes for Lecture 17-18
U.C. Berkeley CS278: Compuaional Complexiy Handou N7-8 Professor Luca Trevisan April 3-8, 2008 Noes for Lecure 7-8 In hese wo lecures we prove he firs half of he PCP Theorem, he Amplificaion Lemma, up
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 informationMon Apr 2: Laplace transform and initial value problems like we studied in Chapter 5
Mah 225-4 Week 2 April 2-6 coninue.-.3; alo cover par of.4-.5, EP 7.6 Mon Apr 2:.-.3 Laplace ranform and iniial value problem like we udied in Chaper 5 Announcemen: Warm-up Exercie: Recall, The Laplace
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 informationCHAPTER 7. Definition and Properties. of Laplace Transforms
SERIES OF CLSS NOTES FOR 5-6 TO INTRODUCE LINER ND NONLINER PROBLEMS TO ENGINEERS, SCIENTISTS, ND PPLIED MTHEMTICINS DE CLSS NOTES COLLECTION OF HNDOUTS ON SCLR LINER ORDINRY DIFFERENTIL EQUTIONS (ODE")
More information6.302 Feedback Systems Recitation : Phase-locked Loops Prof. Joel L. Dawson
6.32 Feedback Syem Phae-locked loop are a foundaional building block for analog circui deign, paricularly for communicaion circui. They provide a good example yem for hi cla becaue hey are an excellen
More information1 Review of Zero-Sum Games
COS 5: heoreical Machine Learning Lecurer: Rob Schapire Lecure #23 Scribe: Eugene Brevdo April 30, 2008 Review of Zero-Sum Games Las ime we inroduced a mahemaical model for wo player zero-sum games. Any
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 informationStat13 Homework 7. Suggested Solutions
Sa3 Homework 7 hp://www.a.ucla.edu/~dinov/coure_uden.hml Suggeed Soluion Queion 7.50 Le denoe infeced and denoe noninfeced. H 0 : Malaria doe no affec red cell coun (µ µ ) H A : Malaria reduce red cell
More information3.1.3 INTRODUCTION TO DYNAMIC OPTIMIZATION: DISCRETE TIME PROBLEMS. A. The Hamiltonian and First-Order Conditions in a Finite Time Horizon
3..3 INRODUCION O DYNAMIC OPIMIZAION: DISCREE IME PROBLEMS A. he Hamilonian and Firs-Order Condiions in a Finie ime Horizon Define a new funcion, he Hamilonian funcion, H. H he change in he oal value of
More informationINDEPENDENT SETS IN GRAPHS WITH GIVEN MINIMUM DEGREE
INDEPENDENT SETS IN GRAPHS WITH GIVEN MINIMUM DEGREE JAMES ALEXANDER, JONATHAN CUTLER, AND TIM MINK Absrac The enumeraion of independen ses in graphs wih various resricions has been a opic of much ineres
More informationDETC2004/CIE ALGORITHMIC FOUNDATIONS FOR CONSISTENCY-CHECKING OF INTERACTION-STATES OF MECHATRONIC SYSTEMS
Proceeding of DETC 04 ASME 2004 Deign Engineering Technical Conference and Compuer and Informaion in Engineering Conference Sal Lake Ciy, Uah, USA, Sepember 28-Ocober 2, 2004 DETC2004/CIE-79 ALGORITHMIC
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 informationEE202 Circuit Theory II
EE202 Circui Theory II 2017-2018, Spring Dr. Yılmaz KALKAN I. Inroducion & eview of Fir Order Circui (Chaper 7 of Nilon - 3 Hr. Inroducion, C and L Circui, Naural and Sep epone of Serie and Parallel L/C
More informationSome Ramsey results for the n-cube
Some Ramsey resuls for he n-cube Ron Graham Universiy of California, San Diego Jozsef Solymosi Universiy of Briish Columbia, Vancouver, Canada Absrac In his noe we esablish a Ramsey-ype resul for cerain
More informationARTIFICIAL INTELLIGENCE. Markov decision processes
INFOB2KI 2017-2018 Urech Univeriy The Neherland ARTIFICIAL INTELLIGENCE Markov deciion procee Lecurer: Silja Renooij Thee lide are par of he INFOB2KI Coure Noe available from www.c.uu.nl/doc/vakken/b2ki/chema.hml
More information