Mechtild Stoer * Frank Wagner** Abstract. fastest algorithm known. The runtime analysis is straightforward. In contrast to
|
|
- Cynthia Freeman
- 6 years ago
- Views:
Transcription
1 SERIE B INFORMATIK A Simple Min Cu Algorihm Mechild Soer * Frank Wagner** B 9{1 May 199 Abrac We preen an algorihm for nding he minimum cu of an edge-weighed graph. I i imple in every repec. I ha a hor and compac decripion, i eay o implemen and ha a urpriingly imple proof of correcne. I runime mache ha of he fae algorihm known. The runime analyi i raighforward. In conra o nearly all approache o far, he algorihm ue no ow echnique. Roughly poken he algorihm coni of abou jv j nearly idenical phae each of which i formally imilar o Prim' minimum panning ree algorihm. *Konrad-Zue-Zenrum fur Informaionechnik Berlin, Heilbronner Sr. 10, Berlin, Germany, e- mail: oer@zib-berlin.de. **Iniu fur Informaik, Fachbereich Mahemaik und Informaik, Freie Univeria Berlin, Takurae 9, 1195 Berlin-Dahlem, Germany, wagner@mah.fu-berlin.de.
2 1 Overview Graph conneciviy i one of he claical ubjec in graph heory, and ha many pracical applicaion, e. g. in chip and circui deign, reliabiliy of communicaion nework, ranporaion planning and cluer analyi. Finding he minimum cu of an edge-weighed graph i a fundamenal algorihmical problem. Preciely, i coni in nding a nonrivial pariion of he graph' verex e V ino wo par uch ha he um of he weigh of he edge connecing he wo par i minimum. The uual approach o olve hi problem i o ue i cloe relaionhip o he maximum ow problem. The famou Max-Flow-Min-Cu-Theorem by Ford and Fulkeron [FF5] howed he dualiy of he maximum ow and he o-called minimum - cu. There, and are wo verice which are he ource and he ink in he ow problem and have o be eparaed by he cu, i.e., hey have o lie in dieren par of he pariion. Unil recenly all cu algorihm were eenially ow algorihm uing hi dualiy. Finding a minimum cu wihou pecied verice o be eparaed can be done by nding minimum - cu for all O(jV j ) pair of verice and hen elecing he lighe one. Gomory and Hu [GH1] reduced hi o O(jV j) pair of verice and hu O(jV j) maximum ow compuaion. Recenly Hao and Orlin [HO9] howed how o ue he maximum ow algorihm by Goldberg and Tarjan [GT88], he fae o far, in order o olve he minimum cu problem a fa a he maximum ow problem, i.e., in ime O(jV jjej log(jv j =jej). In he ame year Nagamochi and Ibaraki [NI9a] publihed he r minimum cu algorihm ha i no baed on a ow algorihm, ha he lighly beer running ime of O(jV jjej + jv j log jv j) bu i ill raher complicaed. In he unweighed cae hey ue a fa earch echnique o decompoe a graph' edge e E ino ube E 1 ::: E uch ha he union of he r k E i ' i a k-edge-conneced panning ubgraph of he given graph and ha ize a mo kjv j. Theyimulae hi approach in he weighed cae. Their work i one of a number of paper reaing queion of graph conneciviy by non-ow-baed mehod [NP89, NI9a, M9]. In hi conex we preen in hi paper a remarkably imple minimum cu algorihm wih he opimal running ime eablihed in [NI9b]. We reduce he complexiy of he algorihm of Nagamochi and Ibaraki by avoiding he unneceary imulaed decompoiion of he edge e. Thi enable u o give a comparably raighforward proof of correcne avoiding e. g. he diincion beween he unweighed, ineger-, raional-, and real-weighed cae. The Algorihm Throughou he paper we deal wih an ordinary undireced graph G wih verex e V and edge e E. Every edge e ha poiive realweigh w(e). In order o decribe he idea of he algorihm we ar by reminding he reader of Prim' minimum panning ree algorihm: MinimumSpanningTree(G w a)
3 A Simple Min Cu Algorihm A fag T while A = V add o A he mo looely conneced verex add o T he connecing edge A ube A of he graph' verice grow aring wih an arbirary ingle verex unil A i equal o V. In each ep he verex ouide of A mo looely conneced wih A i added. Formally, we add a verex z A uch ha w(a z) =minfw(b y) j b A y A by Eg where w(b y) i he weigh ofedgeby and az i he connecing edge. A he end he e of all he connecing edge hen form a minimum panning ree. The imple minimum cu algorihm we decribe here coni of jv j;1 phae each of which i very imilar o Prim' algorihm: MinimumCuPhae(G w a) A fag while A = V add o A he mo ighly conneced verex ore he cu-of-he-phae and hrink G by merging he wo verice added la A ube A of he graph' verice grow aring wih an arbirary ingle verex unil A i equal o V. In each ep he verex ouide of A mo ighly conneced wih A i added. Formally, we add a verex z A uch ha w(a z) = maxfw(a y) j y Ag where w(a y) iheumofheweigh of all he edge beween A and y. A he end of each uch phae he wo verice added la are merged, i.e., he wo verice are replaced by anewverex, and any edge from he wo verice o a remaining verex are replaced by anedgeweighed by he um of he weigh of he previou wo edge. Edge joining he merged node are removed. The cu of V ha eparae he verex added la from he re of he graph i called he cu-of-he-phae. The lighe of hee cu-of-he-phae i he reul of he algorihm, he deired minimum cu. MinimumCu(G w a) while jv j > 1 MinimumCuPhae(G w a) if he cu-of-he-phae i ligher han he curren minimum cu hen ore he cu-of-he-phae a he curren minimum cu Noice ha he aring verex a ay he ame hroughou he whole algorihm. An Example
4 w(1 ) = Figure 1: A graph G =(V E) wih edge-weigh. 1 a b c f d 8 e Figure : The graph afer he r MinimumCuPhae(G w a), a =, and he induced ordering a b c d e f of he verice. The r cu-of-he-phae correpond o he pariion f1g f 5 7 8g of V wih weigh w =5. a d e b 7 1 c 8 Figure : The graph afer he econd MinimumCuPhae(G w a), and he induced ordering a b c d e of he verice. The econd cu-of-he-phae correpond o he pariion f8g f1 5 7g of V wih weigh w =5.
5 A Simple Min Cu Algorihm 5 a d b c Figure : Afer he hird MinimumCuPhae(G w a). The hird cu-of-he-phae correpond o he pariion f7 8g f1 5 g of V wih weigh w =7. a a b c b Figure 5: Afer he fourh and fh MinimumCuPhae(G w a), repecively. The fourh cu-of-he-phae correpond o he pariion f 7 8g f1 5 g. The fh cu-of-he-phae correpond o he pariion f 7 8g f1 5 g wih weigh w =.
6 a V n Figure : Afer he ixh and evenh MinimumCuPhae(G w a) repecively. The ixh cu-of-he-phae correpond o he pariion fg f 7 8g wih weigh w = 7. The la cu-of-he-phae correpond o he pariion fg V nfg i weigh i w = 9. The minimum cu of he graph G i he fh cu-of-he-phae and he weigh iw =. Correcne The core of he proof of correcne i he following omewha urpriing lemma. Lemma Each cu-of-he-phae i a minimum - cu in he curren graph, where and are he wo verice added la in he phae. Auming, ha he lemma hold, we can how by a imple cae diincion, ha he malle of hee cu-of-he-phae i indeed he minimum cu we are looking for. Thi i done by inducion on jv j. The cae jv j = i rivial. If jv j, look a he r phae: If G ha a minimum cu, ha i a he ame ime a minimum - cu, hen, according o he lemma, he cu-of-he phae i already a minimum cu. If no, hen G ha a minimum cu wih and on he ame ide. Therefore, a minimum cu of G 0, he inpu graph of phae, ha dier from G by he merging of and, i a minimum cu of G. Now, by inducion, he lighe of he cu-of-he-phae ojv j;1iuch a minimum cu of G 0. Noice ha he applicaion of phae o jv j;1og 0 i he ame a he applicaion of he complee algorihm o G 0. Finally, we how he claimed propery of he cu-of-he-phae. The run of a MinimumCuPhae order he verice of he curren graph linearly, aring wih a and ending wih and, according o heir order of addiion o A. Nowwelook a an arbirary - cu C of he curren graph and how, ha i i a lea a heavy a he cu-of-he-phae.
7 A Simple Min Cu Algorihm 7 We callaverex v = a acive (wih repec o C) when v and he verex added ju before v are in dieren parofc. Le w(c) be he weigh ofc, A v he e of all verice added before v (excluding v), C v he pariion of A v [fvg induced by C, and w(c v ) he weigh of he induced cu, i.e., he um of he weigh of he edge going from one par of he induced pariion o he oher. We how ha for every acive verex v w(a v v) w(c v ) by inducion on he e of acive verice: For he r acive verex he inequaliy i aied wih equaliy. Le he inequaliy be rue for all acive verice added up o he acive verex v, and le w be he nex acive verex ha i added. Then we have w(a w w)=w(a v w)+w(a w n A v w)=: Now, w(a v w) w(a v v)a v wa choen a he verex mo ighly conneced wih A v. By inducion w(a v v) w(c v ). All edge beween A w n A v and w connec he dieren parofc. Thu hey conribue o w(c w bu no o w(c v ). So w(c v )+w(a w n A v w) w(c w ) A i alway an acive verex wih repec o C we can conclude ha w(a ) w(c ) which ay exacly ha he cu-of-he-phae i a mo a heavy a C. 5 Running Time A he running ime of he algorihm MinimumCu i eenially equal o he added running ime of he jv j;1 run of MinimumCuPhae, which i called on graph wih decreaing number of verice and edge, i uce o how ha a ingle MinimumCuPhae need a mo O(jEj + jv j log jv j) ime yielding an overall running ime of O(jV jjej + jv j log jv j). The key o implemening a phae ecienly i o make i eay o elec he nex verex o be added o he e A, he mo ighly conneced verex. During execuion of a phae, all verice ha are no in A reide in a prioriy queue baed on a key eld. The key of a verex v i he um of he weigh of he edge connecing i o he curren A, i.e.,w(a v). Whenever a verex v i added o A we have o perform an updae of he queue. v ha o be deleed from he queue, and he key of every verex w no in A, conneced o v ha o be increaed by he weigh of he edge vw, if i exi. A hi i done exacly once for every edge, overall we have o perform jv j ExracMax and jej IncreaeKey operaion. Uing Fibonacci heap [FT87], we can perform an ExracMax operaion in O(log jv j) amorized ime and a IncreaeKey operaion in O(1) amorized ime. Thu he ime we need for hi key ep ha dominae he re of he phae, i O(jEj + jv j log jv j). Noice, ha hi runime analyi i very imilar o he analyi of Prim' minimum panning ree algorihm.
8 8 Acknowledgemen The auhor hank Dorohea Wagner for her helpful remark. Reference [FT87] M. L. Fredman and R. E. Tarjan, Fibonacci heap and heir ue in improved nework opimizaion algorihm, Journal of he ACM (1987) 59{ 15 [FF5] L. R. Ford, D. R. Fulkeron, Maximal ow hrough a nework, Canadian Journal on Mahemaic 8 (195) 99{0 [GT88] A. V. Goldberg and R. E. Tarjan, A new approach o he maximum ow problem, Journal of he ACM 5 (1988) 91{90 [GH1] R. E. Gomory, Muli-erminal nework ow, Journal of he SIAM 9 (191) 551{570 [HO9] X. Hao and J. B. Orlin, A faer algorihm for nding he minimum cu inagraph, rd ACM-SIAM Sympoium on Dicree Algorihm (199) 15{17 [M9] D. W. Maula A linear ime + approximaion algorihm for edge conneciviy, Proceeding of he h ACM-SIAM Sympoium on Dicree Mahemaic (199) 500{50 [NI9a] H. Nagamochi and T. Ibaraki, Linear ime algorihm for nding a pare k-conneced panning ubgraph of a k-conneced graph, Algorihmica 7 (199) 58{59 [NI9b] H. Nagamochi and T. Ibaraki, Compuing edge-conneciviy in muligraph and capaciaed graph, SIAM Journal on Dicree Mahemaic 5 (199) 5{ [NP89] T. Nihizeki and S. Poljak, Highly conneced facor wih a mall number of edge, Preprin (1989) [P57] R. C. Prim, Shore connecion nework and ome generalizaion, Bell Syem Technical Journal (1957) 189{101
Algorithmic 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 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 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 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 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 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 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 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 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 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 information1 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 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 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 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 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 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 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 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 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 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 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 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 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 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 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 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 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. 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 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 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 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 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 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 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 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 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 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 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 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 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 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 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 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 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 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 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 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 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 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 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 informationResearch Article An Upper Bound on the Critical Value β Involved in the Blasius Problem
Hindawi Publihing Corporaion Journal of Inequaliie and Applicaion Volume 2010, Aricle ID 960365, 6 page doi:10.1155/2010/960365 Reearch Aricle An Upper Bound on he Criical Value Involved in he Blaiu Problem
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 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 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 informationFLAT CYCLOTOMIC POLYNOMIALS OF ORDER FOUR AND HIGHER
#A30 INTEGERS 10 (010), 357-363 FLAT CYCLOTOMIC POLYNOMIALS OF ORDER FOUR AND HIGHER Nahan Kaplan Deparmen of Mahemaic, Harvard Univeriy, Cambridge, MA nkaplan@mah.harvard.edu Received: 7/15/09, Revied:
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 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 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 informationStationary Distribution. Design and Analysis of Algorithms Andrei Bulatov
Saionary Disribuion Design and Analysis of Algorihms Andrei Bulaov Algorihms Markov Chains 34-2 Classificaion of Saes k By P we denoe he (i,j)-enry of i, j Sae is accessible from sae if 0 for some k 0
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 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 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 informationEE Control Systems LECTURE 2
Copyrigh F.L. Lewi 999 All righ reerved EE 434 - Conrol Syem LECTURE REVIEW OF LAPLACE TRANSFORM LAPLACE TRANSFORM The Laplace ranform i very ueful in analyi and deign for yem ha are linear and ime-invarian
More informationDiscussion Session 2 Constant Acceleration/Relative Motion Week 03
PHYS 100 Dicuion Seion Conan Acceleraion/Relaive Moion Week 03 The Plan Today you will work wih your group explore he idea of reference frame (i.e. relaive moion) and moion wih conan acceleraion. You ll
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 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 informationLongest Common Prefixes
Longes Common Prefixes The sandard ordering for srings is he lexicographical order. I is induced by an order over he alphabe. We will use he same symbols (,
More informationLower and Upper Approximation of Fuzzy Ideals in a Semiring
nernaional Journal of Scienific & Engineering eearch, Volume 3, ue, January-0 SSN 9-558 Lower and Upper Approximaion of Fuzzy deal in a Semiring G Senhil Kumar, V Selvan Abrac n hi paper, we inroduce he
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 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 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 informationResearch Article On Double Summability of Double Conjugate Fourier Series
Inernaional Journal of Mahemaic and Mahemaical Science Volume 22, Aricle ID 4592, 5 page doi:.55/22/4592 Reearch Aricle On Double Summabiliy of Double Conjugae Fourier Serie H. K. Nigam and Kuum Sharma
More informationImplementation of 64-Point FFT Processor Based on Radix-2 Using Verilog
Inernaional Journal of Engineering Reearch & Technology (IJERT) Implemenaion of 64-oin roceor Baed on Radix-2 Uing Verilog T.TIRUALA KOTESWARA RAO 1, S. SARATH CHANDRA 2 Suden of. Tech Deparmen of Elecronic
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 informationAdaptation and Synchronization over a Network: stabilization without a reference model
Adapaion and Synchronizaion over a Nework: sabilizaion wihou a reference model Travis E. Gibson (gibson@mi.edu) Harvard Medical School Deparmen of Pahology, Brigham and Women s Hospial 55 h Conference
More informationThe multisubset sum problem for finite abelian groups
Alo available a hp://amc-journal.eu ISSN 1855-3966 (prined edn.), ISSN 1855-3974 (elecronic edn.) ARS MATHEMATICA CONTEMPORANEA 8 (2015) 417 423 The muliube um problem for finie abelian group Amela Muraović-Ribić
More informationHow to Solve System Dynamic s Problems
How o Solve Sye Dynaic Proble A ye dynaic proble involve wo or ore bodie (objec) under he influence of everal exernal force. The objec ay uliaely re, ove wih conan velociy, conan acceleraion or oe cobinaion
More informationGeneralized Orlicz Spaces and Wasserstein Distances for Convex-Concave Scale Functions
Generalized Orlicz Space and Waerein Diance for Convex-Concave Scale Funcion Karl-Theodor Surm Abrac Given a ricly increaing, coninuou funcion ϑ : R + R +, baed on he co funcional ϑ (d(x, y dq(x, y, we
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 informationGeometric Path Problems with Violations
Click here o view linked Reference 1 1 1 0 1 0 1 0 1 0 1 Geomeric Pah Problem wih Violaion Anil Mahehwari 1, Subha C. Nandy, Drimi Paanayak, Saanka Roy and Michiel Smid 1 1 School of Compuer Science, Carleon
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 informationMatrix Versions of Some Refinements of the Arithmetic-Geometric Mean Inequality
Marix Versions of Some Refinemens of he Arihmeic-Geomeric Mean Inequaliy Bao Qi Feng and Andrew Tonge Absrac. We esablish marix versions of refinemens due o Alzer ], Carwrigh and Field 4], and Mercer 5]
More informationT-Rough Fuzzy Subgroups of Groups
Journal of mahemaic and compuer cience 12 (2014), 186-195 T-Rough Fuzzy Subgroup of Group Ehagh Hoeinpour Deparmen of Mahemaic, Sari Branch, Ilamic Azad Univeriy, Sari, Iran. hoienpor_a51@yahoo.com Aricle
More informationTRADITIONAL. MAP: Multi-Constrained Anypath Routing in Wireless Mesh Networks. 1 Introduction
MAP: Muli-Conrained Anypah Rouing in Wirele Meh Nework Xi Fang, Member, IEEE, Dejun Yang, Member, IEEE, and Guoliang Xue, Fellow, IEEE Abrac Anypah rouing ha been propoed o improve he performance of unreliable
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 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 informationT L. t=1. Proof of Lemma 1. Using the marginal cost accounting in Equation(4) and standard arguments. t )+Π RB. t )+K 1(Q RB
Elecronic Companion EC.1. Proofs of Technical Lemmas and Theorems LEMMA 1. Le C(RB) be he oal cos incurred by he RB policy. Then we have, T L E[C(RB)] 3 E[Z RB ]. (EC.1) Proof of Lemma 1. Using he marginal
More information13.1 Circuit Elements in the s Domain Circuit Analysis in the s Domain The Transfer Function and Natural Response 13.
Chaper 3 The Laplace Tranform in Circui Analyi 3. Circui Elemen in he Domain 3.-3 Circui Analyi in he Domain 3.4-5 The Tranfer Funcion and Naural Repone 3.6 The Tranfer Funcion and he Convoluion Inegral
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 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 information6 December 2013 H. T. Hoang - www4.hcmut.edu.vn/~hthoang/ 1
Lecure Noe Fundamenal of Conrol Syem Inrucor: Aoc. Prof. Dr. Huynh Thai Hoang Deparmen of Auomaic Conrol Faculy of Elecrical & Elecronic Engineering Ho Chi Minh Ciy Univeriy of Technology Email: hhoang@hcmu.edu.vn
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 informationAdditional Methods for Solving DSGE Models
Addiional Mehod for Solving DSGE Model Karel Meren, Cornell Univeriy Reference King, R. G., Ploer, C. I. & Rebelo, S. T. (1988), Producion, growh and buine cycle: I. he baic neoclaical model, Journal of
More informationPerformance Comparison of LCMV-based Space-time 2D Array and Ambiguity Problem
Inernaional journal of cience Commerce and umaniie Volume No 2 No 3 April 204 Performance Comparion of LCMV-baed pace-ime 2D Arra and Ambigui Problem 2 o uan Chang and Jin hinghia Deparmen of Communicaion
More informationarxiv: v2 [cs.cg] 30 Apr 2015
Diffue Reflecion Diameer in Simple Polygon arxiv:1302.2271v2 [c.cg] 30 Apr 2015 Gill Bareque Deparmen of Compuer Science Technion Haifa, Irael bareque@c.echnion.ac.il Eli Fox-Epein Deparmen of Compuer
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 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 information