Maximum Flow. Contents. Max Flow Network. Maximum Flow and Minimum Cut
|
|
- Jewel Doyle
- 5 years ago
- Views:
Transcription
1 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 Wayne Maximum Flow and Minimum Cu Max Flow Nework Max low and min cu. Two very rich algorihmic problem. Cornerone problem in combinaorial opimizaion. Beauiul mahemaical dualiy. Max low nework: G (V, E,,, u). (V, E) direced graph, no parallel arc. Two diinguihed node: ource, ink. u( capaciy o arc e. Nonrivial applicaion / reducion. Nework conneciviy. Biparie maching. Daa mining. Open-pi mining. Airline cheduling. Image proceing. Projec elecion. Nework reliabiliy. Securiy o aiical daa. Diribued compuing. Egaliarian able maching. Diribued compuing. Many many more... Baeball eliminaion. Capaciy
2 Flow An - low i a uncion : E R ha aiie: For each e E: ( u( (capaciy) For each v V {, }: (conervaion) e in o v e ou o v Flow An - low i a uncion : E R ha aiie: For each e E: ( u( (capaciy) For each v V {, }: (conervaion) e in o v e ou o v e in o v : w :( w, v) E ( w, v) e ou o v : w :( v, w) E ( v, w) MAX FLOW: ind - low ha maximize ne low ou o he ource. e ou o Capaciy Flow Capaciy Flow Value Flow Flow An - low i a uncion : E R ha aiie: For each e E: ( u( (capaciy) For each v V {, }: (conervaion) e in o v e ou o v MAX FLOW: ind - low ha maximize ne low ou o he ource. An - low i a uncion : E R ha aiie: For each e E: ( u( (capaciy) For each v V {, }: (conervaion) e in o v e ou o v MAX FLOW: ind - low ha maximize ne low ou o he ource. Capaciy Flow Value Capaciy Flow Value
3 Nework communicaion circui Node Nework elephone exchange, compuer, aellie gae, regier, proceor Arc cable, iber opic, microwave relay wire Flow voice, video, packe curren mechanical join rod, beam, pring hea, energy hydraulic reervoir, pumping aion, lake pipeline luid, oil inancial ock, currency ranacion money ranporaion airpor, rail yard, ree inerecion highway, railbed, airway roue reigh, vehicle, paenger chemical ie bond energy Cu An - cu i a node pariion (S, T) uch ha S, T. The capaciy o an - cu (S, T) i: u( : u( v, w). e ou o S ( v, w ) E v S, w T Min - cu: ind an - cu o minimum capaciy. Capaciy Cu An - cu i a node pariion (S, T) uch ha S, T. The capaciy o an - cu (S, T) i: u( : u( v, w). e ou o S ( v, w ) v S E, w T Min - cu: ind an - cu o minimum capaciy. Cu An - cu i a node pariion (S, T) uch ha S, T. The capaciy o an - cu (S, T) i: u( : u( v, w). e ou o S ( v, w ) v S E, w T Min - cu: ind an - cu o minimum capaciy. Capaciy Capaciy
4 Flow and Cu L. Le be a low, and le (S, T) be a cu. Then, he ne low en acro he cu i equal o he amoun reaching. Flow and Cu L. Le be a low, and le (S, T) be a cu. Then, he ne low en acro he cu i equal o he amoun reaching. e ou o S e in o S e ou o e ou o S e in o S e ou o Value Value L. Le be a low, and le (S, T) be a cu. Then, he ne low en acro he cu i equal o he amoun reaching. e ou o S Flow and Cu e in o S e ou o Flow and Cu Le be a low, and le (S, T) be a cu. Then, S e in o S e ou o Proo by inducion on S. Bae cae: S { }. Inducive hypohei: aume rue or S < k. conider cu (S, T) wih S k S S { v } or ome v,, S k- cap(s, T ). adding v o S increae cu capaciy by e ou o v e in o v. v v Value S Beore S Aer
5 Flow and Cu Max Flow and Min Cu L. Le be a low, and le (S, T) be a cu. Then, cap(s, T). Proo. e ou o S e ou o S u( e ou o S cap(s, T) e in o S S T Corollary. Le be a low, and le (S, T) be a cu. I cap(s, T), hen i a max low and (S, T) i a min cu. Corollary. Le be a low, and le (S, T) be a cu. I cap(s, T), hen i a max low and (S, T) i a min cu. Cu capaciy Flow value Max-Flow Min-Cu Theorem MAX-FLOW MIN-CUT THEOREM (Ford-Fulkeron, ): In any nework, he value o he max low i equal o he value o he min cu. "Good characerizaion." Proo IOU. Toward an Algorihm Find an - pah where each arc ha u( > ( and "augmen" low along he pah. Cu capaciy Flow value Flow value
6 Toward an Algorihm Toward an Algorihm Find an - pah where each arc ha u( > ( and "augmen" low along he pah. Repea unil you ge uck. Find an - pah where each arc ha u( > ( and "augmen" low along he pah. Repea unil you ge uck. Greedy algorihm ail. X X X Flow value Flow value Flow value Reidual Arc Reidual Graph and Augmening Pah Original graph G (V, E). Flow (. Arc e (v, w) E. Capaciy Reidual graph: G (V, E ). E {e : ( < u(} {e R : ( > }. u ( u( ( i i e E R e E v w Reidual graph: G (V, E ). Reidual arc e (v, w) and e R (w, v). "Undo" low en. Flow G Reidual capaciy v w G Reidual capaciy
7 Augmening Pah Augmening pah pah in reidual graph. Augmening Pah Augmening pah pah in reidual graph. Max low no augmening pah??? G X X X X X G Flow value G G Max-Flow Min-Cu Theorem Proo o Max-Flow Min-Cu Theorem Augmening pah heorem (Ford-Fulkeron, ): A low i a max low i and only i here are no augmening pah. MAX-FLOW MIN-CUT THEOREM (Ford-Fulkeron, ): he value o he max low i equal o he value o he min cu. We prove boh imulaneouly by howing he TFAE: (i) i a max low. (ii) There i no augmening pah relaive o. (iii) There exi a cu (S, T) uch ha cap(s, T). We prove boh imulaneouly by howing he TFAE: (i) i a max low. (ii) There i no augmening pah relaive o. (iii) There exi a cu (S, T) uch ha cap(s, T). (i) (ii) We how conrapoiive. Le be a low. I here exi an augmening pah, hen we can improve by ending low along pah. (iii) (i) Nex lide. (iii) (i) Thi wa he Corollary o Lemma.
8 Proo o Max-Flow Min-Cu Theorem Augmening Pah Algorihm We prove boh imulaneouly by howing he TFAE: (i) i a max low. (ii) There i no augmening pah relaive o. (iii) There exi a cu (S, T) uch ha cap(s, T). (ii) (iii) Le be a low wih no augmening pah. Le S be e o verice reachable rom in reidual graph. clearly S, and S by deiniion o Augmen (, P) b boleneck(p) FOREACH e P IF (e E) // orward arc ( ( + b ELSE // backward arc (e R ) ( - b RETURN FordFulkeron (V, E,, ) e ou o e ou o u( S cap(s, T) S e in o S S Original Nework T FOREACH e E ( reidual graph G WHILE (here exi augmening pah P) augmen(, P) updae G RETURN Running Time Chooing Good Augmening Pah Aumpion: all capaciie are ineger beween and U. Ue care when elecing augmening pah. Invarian: every low value ( and every reidual capaciie u ( remain an ineger hroughou he algorihm. Theorem: he algorihm erminae in a mo * nu ieraion. Corollary: i U, hen algorihm run in O(mn) ime. Inegraliy heorem: i all arc capaciie are ineger, hen here exi a max low or which every low value ( i an ineger. Noe: algorihm may no erminae on ome pahological inance (wih irraional capacii. Moreover, low value may no even converge o correc anwer.
9 Chooing Good Augmening Pah Ue care when elecing augmening pah. Chooing Good Augmening Pah Ue care when elecing augmening pah. X X X Chooing Good Augmening Pah Ue care when elecing augmening pah. Chooing Good Augmening Pah Ue care when elecing augmening pah. X X X ieraion poible.
10 Chooing Good Augmening Pah Capaciy Scaling Ue care when elecing augmening pah. Some choice lead o exponenial algorihm. Clever choice lead o polynomial algorihm. Goal: chooe augmening pah o ha: Can ind augmening pah eicienly. Few ieraion. Inuiion: chooing pah wih highe boleneck capaciy increae low by max poible amoun. Don worry abou inding exac highe boleneck pah. Mainain caling parameer. Le G ( ) be he ubgraph o he reidual graph coniing o only arc wih capaciy a lea. Edmond-Karp (): chooe augmening pah wih Max boleneck capaciy. (a pah) Suicienly large capaciy. (capaciy-caling) Fewe number o arc. (hore pah) G G () Capaciy Scaling Capaciy Scaling: Analyi Inuiion: chooing pah wih highe boleneck capaciy increae low by max poible amoun. Don worry abou inding exac highe boleneck pah. Mainain caling parameer. Le G ( ) be he ubgraph o he reidual graph coniing o only arc wih capaciy a lea. ScalingMaxFlow(V, E,, ) FOREACH e E, ( malle power o greaer han or equal o U WHILE ( ) G ( ) -reidual graph WHILE (here exi augmening pah P in G ( )) augmen(, P) updae G ( ) / RETURN L. I all arc capaciie are ineger, hen hroughou he algorihm, all low and reidual capaciy value remain ineger. Thu, G ( ) G, o upon erminaion i a max low. L. The ouer while loop repea + log U ime. Iniially U <U, and decreae by a acor o each ieraion. L. Le be he low a he end o a -caling phae. Then value o he maximum low i a mo + m. L. There are a mo m augmenaion per caling phae. Le be he low a he end o he previou caling phae. L * + m ( ). Each augmenaion in a -phae increae by a lea. Theorem. The algorihm run in O(m log (U) ) ime.
11 Capaciy Scaling: Analyi L. Le be he low a he end o a -caling phae. Then value o he maximum low i a mo + m. We how ha a he end o a -phae, here exi a cu (S, T) uch ha cap(s, T) + m. Chooe S o be he e o node reachable rom in G ( ). clearly S, and S by deiniion o S e ou o S e ou o S e ou o S cap(s, T) ( u( ) u( - e in o S m e in o S e ou o S e in o S S Original Nework T Chooing Good Augmening Pah Ue care when elecing augmening pah. Some choice lead o exponenial algorihm. Clever choice lead o polynomial algorihm. Goal: chooe augmening pah o ha: Can ind augmening pah eicienly. Few ieraion. Edmond-Karp (): chooe augmening pah wih Max boleneck capaciy. (a pah) Suicienly large capaciy. (capaciy-caling) Fewe number o arc. (hore pah) Shore Augmening Pah Inuiion: chooing pah via breadh ir earch. Eay o implemen. may implemen by coincidence! Find augmening pah wih ewe number o arc. FOREACH e E ( reidual graph G ShoreAugmeningPah(V, E,, ) WHILE (here exi augmening pah) ind uch a pah P by BFS augmen(, P) updae G RETURN Shore Augmening Pah: Overview o Analyi L. Throughou he algorihm, he lengh o he hore pah never decreae. Proo ahead. L. Aer a mo m hore pah augmenaion, he lengh o he hore augmening pah ricly increae. Proo ahead. Theorem. The hore augmening pah algorihm run in O(m n) ime. O(m+n) ime o ind hore augmening pah via BFS. O(m) augmenaion or pah o exacly k arc. I here i an augmening pah, here i a imple one. k < n O(mn) augmenaion.
12 Shore Augmening Pah: Analyi Shore Augmening Pah: Analyi Level graph o (V, E, ). For each verex v, deine l(v) o be he lengh (number o arc) o hore pah rom o v. L G (V, E G ) i ubgraph o G ha conain only hoe arc (v,w) E wih l(w) l(v) +. G: Level graph o (V, E, ). For each verex v, deine l(v) o be he lengh (number o arc) o hore pah rom o v. L (V, F) i ubgraph o G ha conain only hoe arc (v,w) E wih l(w) l(v) +. Compue in O(m+n) ime uing BFS, deleing back and ide arc. P i a hore -v pah in G i and only i i i an -v pah L. L: L G : l l l l l l l l Shore Augmening Pah: Analyi Shore Augmening Pah: Analyi L. Throughou he algorihm, he lengh o he hore pah never decreae. L. Aer a mo m hore pah augmenaion, he lengh o he hore augmening pah ricly increae. Le and be low beore and aer a hore pah augmenaion. Le L and L be level graph o G and G Only back arc added o G pah wih back arc ha lengh greaer han previou lengh A lea one arc (he boleneck arc) i deleed rom L aer each augmenaion. No new arc added o L unil lengh o hore pah ricly increae. L L l l l l l l l l L L
13 Shore Augmening Pah: Review o Analyi Shore Augmening Pah: Improved Verion L. Throughou he algorihm, he lengh o he hore pah never decreae. L. Aer a mo m hore pah augmenaion, he lengh o he hore augmening pah ricly increae. Theorem. The hore augmening pah algorihm run in O(m n) ime. O(m+n) ime o ind hore augmening pah via BFS. O(m) augmenaion or pah o exacly k arc. O(mn) augmenaion. Two ype o augmenaion. Normal augmenaion: lengh o hore pah doen change. Special augmenaion: lengh o hore pah ricly increae. L. Group o normal augmenaion ake O(mn) ime. Explicily mainain level graph - i change by a mo n arc aer each normal augmenaion. Sar a, advance along an arc in L G unil reach or ge uck. i reach, augmen and delee a lea one arc i ge uck, delee node Noe: Θ(mn) augmenaion neceary on ome nework. Try o decreae ime per augmenaion inead. L G Dynamic ree O(mn log n) Sleaor-Tarjan, Simple idea O(mn ) l l l l Shore Augmening Pah: Improved Verion Shore Augmening Pah: Improved Verion L G augmen L G augmen L G delee L G L G augmen STOP: lengh o hore pah mu have ricly increaed
14 Shore Augmening Pah: Improved Verion Shore Augmening Pah: Improved Verion ARRAY pred[v V] L G level graph o G v, pred[v] nil REPEAT WHILE (here exi (v,w) L G ) pred[w] v, v w IF (v ) P pah deined by pred[] augmen(, P) updae L G v, pred[v] nil delee v rom L G UNTIL (v ) RETURN AdvanceRerea(V, E,,, ) advance augmen rerea Two ype o augmenaion. Normal augmenaion: lengh o hore pah doen change. Special augmenaion: lengh o hore pah ricly increae. L. Group o normal augmenaion ake O(mn) ime. Explicily mainain level graph - i change by a mo n arc aer each normal augmenaion. Sar a, advance along an arc in L G unil reach or ge uck. i reach, augmen and delee a lea one arc i ge uck, delee node a mo n advance ep beore one o above even Theorem. Algorihm run in O(mn ) ime. O(mn) ime beween pecial augmenaion. A mo n pecial augmenaion. Chooing Good Augmening Pah: Summary Hiory Mehod Augmenaion Running ime Augmening pah nu mnu Max capaciy m log U m log U (m + n log n) Capaciy caling m log U m log U Improved capaciy caling m log U mn log U Shore pah mn m n Improved hore pah mn mn Fir rule aume arc capaciie are beween and U. Year... Dicoverer Mehod Big-Oh Danzig Simplex mn U Ford, Fulkeron Augmening pah mnu Edmond-Karp Shore pah m n Diniz Shore pah mn Edmond-Karp, Diniz Capaciy caling m log U Diniz-Gabow Capaciy caling mn log U Karzanov Prelow-puh n Sleaor-Tarjan Dynamic ree mn log n Goldberg-Tarjan FIFO prelow-puh mn log (n / m) Goldberg-Rao Lengh uncion m / log (n / m) log U mn / log (n / m) log U
Soviet 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 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 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
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 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 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 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 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 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 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 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 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 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. 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 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 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 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 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 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 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 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 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 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 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. 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 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 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 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 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 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 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 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 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 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 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 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 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 informationChapter 7. Network Flow. Slides by Kevin Wayne. Copyright 2005 Pearson-Addison Wesley. All rights reserved.
Chapter 7 Network Flow Slide by Kevin Wayne. Copyright 5 Pearon-Addion Weley. All right reerved. Soviet Rail Network, 55 Reference: On the hitory of the tranportation and maximum flow problem. Alexander
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 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 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 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 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 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 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 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 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 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 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 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 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 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 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 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 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 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 informationDynamic Programming 11/8/2009. Weighted Interval Scheduling. Weighted Interval Scheduling. Unweighted Interval Scheduling: Review
//9 Algorihms Dynamic Programming - Weighed Ineral Scheduling Dynamic Programming Weighed ineral scheduling problem. Insance A se of n jobs. Job j sars a s j, finishes a f j, and has weigh or alue j. Two
More informationAlgorithm Design and Analysis
Algorithm Deign and Analyi LECTURES 1-1 Network Flow Flow, cut Ford-Fulkeron Min-cut/max-flow theorem Adam Smith // A. Smith; baed on lide by E. Demaine, C. Leieron, S. Rakhodnikova, K. Wayne Detecting
More informationMechtild Stoer * Frank Wagner** Abstract. fastest algorithm known. The runtime analysis is straightforward. In contrast to
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
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. Network Flow. CS 350: Winter 2018
Chapter 7 Network Flow CS 3: Winter 1 1 Soviet Rail Network, Reference: On the hitory of the tranportation and maximum flow problem. Alexander Schrijver in Math Programming, 1: 3,. Maximum Flow and Minimum
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 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 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 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 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 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 information7. NETWORK FLOW II. Soviet rail network (1950s) Max-flow and min-cut applications. "Free world" goal. Cut supplies (if cold war turns into real war).
Sovie rail nework (9). NETWORK FLOW II "Free world" goal. Cu upplie (if cold war urn ino real war). Lecure lide by Kevin Wayne Copyrigh Pearon-Addion Weley Copyrigh Kevin Wayne hp://www.c.princeon.edu/~wayne/kleinberg-ardo
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 informationCS Lunch This Week. Special Talk This Week. Soviet Rail Network, Flow Networks. Slides20 - Network Flow Intro.key - December 5, 2016
CS Lunch This Week Panel on Sudying Engineering a MHC Wednesday, December, : Kendade Special Talk This Week Learning o Exrac Local Evens from he Web John Foley, UMass Thursday, December, :, Carr Sovie
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 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 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 information6. DYNAMIC PROGRAMMING II
6. DYNAMIC PROGRAMMING II sequence alignmen Hirschberg's algorihm Bellman-Ford algorihm disance vecor proocols negaive cycles in a digraph 6. DYNAMIC PROGRAMMING II sequence alignmen Hirschberg's algorihm
More informationToday. Flow review. Augmenting paths. Ford-Fulkerson Algorithm. Intro to cuts (reason: prove correctness)
Today Flow review Augmenting path Ford-Fulkeron Algorithm Intro to cut (reaon: prove correctne) Flow Network = ource, t = ink. c(e) = capacity of edge e Capacity condition: f(e) c(e) Conervation condition:
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 informationRandom Walk with Anti-Correlated Steps
Random Walk wih Ani-Correlaed Seps John Noga Dirk Wagner 2 Absrac We conjecure he expeced value of random walks wih ani-correlaed seps o be exacly. We suppor his conjecure wih 2 plausibiliy argumens and
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 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 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 informationAlgorithms and Theory of Computation. Lecture 11: Network Flow
Algorithms and Theory of Computation Lecture 11: Network Flow Xiaohui Bei MAS 714 September 18, 2018 Nanyang Technological University MAS 714 September 18, 2018 1 / 26 Flow Network A flow network is a
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 informationBipartite Matching. Matching. Bipartite Matching. Maxflow Formulation
Mching Inpu: undireced grph G = (V, E). Biprie Mching Inpu: undireced, biprie grph G = (, E).. Mching Ern Myr, Hrld äcke Biprie Mching Inpu: undireced, biprie grph G = (, E). Mflow Formulion Inpu: undireced,
More information6. DYNAMIC PROGRAMMING II
6. DYNAMIC PROGRAMMING II sequence alignmen Hirschberg s algorihm Bellman Ford algorihm disance vecor proocols negaive cycles in a digraph 6. DYNAMIC PROGRAMMING II sequence alignmen Hirschberg s algorihm
More informationTimed Circuits. Asynchronous Circuit Design. Timing Relationships. A Simple Example. Timed States. Timing Sequences. ({r 6 },t6 = 1.
Timed Circuis Asynchronous Circui Design Chris J. Myers Lecure 7: Timed Circuis Chaper 7 Previous mehods only use limied knowledge of delays. Very robus sysems, bu exremely conservaive. Large funcional
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 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 informationWe just finished the Erdős-Stone Theorem, and ex(n, F ) (1 1/(χ(F ) 1)) ( n
Lecure 3 - Kövari-Sós-Turán Theorem Jacques Versraëe jacques@ucsd.edu We jus finished he Erdős-Sone Theorem, and ex(n, F ) ( /(χ(f ) )) ( n 2). So we have asympoics when χ(f ) 3 bu no when χ(f ) = 2 i.e.
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 informationcs/ee 143 Communication Networks
cs/ee 143 Communicaion Neworks Chaper 3 Eherne Tex: Walrand & Parakh, 2010 Seven Low CMS, EE, Calech Warning These noes are no self-conained, probably no undersandable, unless you also were in he lecure
More information7. NETWORK FLOW II. Minimum cut application (RAND 1950s) Maximum flow application (Tolstoǐ 1930s) Max-flow and min-cut applications
Minimum cu applicaion (RAND 90). NETWORK FLOW II Free world goal. Cu upplie (if Cold War urn ino real war). Lecure lide by Kevin Wayne Copyrigh 00 Pearon-Addion Weley biparie maching dijoin pah exenion
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 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 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 informationSolutions for Assignment 2
Faculy of rs and Science Universiy of Torono CSC 358 - Inroducion o Compuer Neworks, Winer 218 Soluions for ssignmen 2 Quesion 1 (2 Poins): Go-ack n RQ In his quesion, we review how Go-ack n RQ can be
More informationFitting Parameters in a Differential Equation With a Non-Analytical Solution
NDSolve u.nb 1 Fiing Parameers in a Dierenial Equaion Wih a Non-Analyical Soluion Mahew Smih 9-Jan-005 In[]:= Remove "Global` " O General::"spell" O General::"spell1" Graphics` Oen dierenial equaions do
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 information