Chapter 7. Network Flow. CS 350: Winter 2018
|
|
- Grace Horn
- 5 years ago
- Views:
Transcription
1 Chapter 7 Network Flow CS 3: Winter 1 1
2 Soviet Rail Network, Reference: On the hitory of the tranportation and maximum flow problem. Alexander Schrijver in Math Programming, 1: 3,.
3 Maximum Flow and Minimum Cut Max flow and min cut. Two very rich algorithmic problem. Cornertone problem in combinatorial optimization. Beautiful mathematical duality. Nontrivial application / reduction. Data mining. Open-pit mining. Project election. Airline cheduling. Bipartite matching. Baeball elimination. Image egmentation. Network connectivity. Network reliability. Ditributed computing. Egalitarian table matching. Security of tatitical data. Network intruion detection. Multi-camera cene recontruction. Many many more 3
4 Minimum Cut Problem Flow network. Abtraction for material flowing through the edge. G = (V, E) = directed graph, no parallel edge. Two ditinguihed node: = ource, t = ink. c(e) = capacity of edge e. ource 3 t ink capacity 3 7
5 Cut Def. An -t cut i a partition (A, B) of V with A and t B. Def. The capacity of a cut (A, B) i: cap(a, B) c(e) e out of A 3 t A 3 7 Capacity = + + = 3
6 Cut Def. An -t cut i a partition (A, B) of V with A and t B. Def. The capacity of a cut (A, B) i: cap(a, B) c(e) e out of A 3 t A 3 7 Capacity = =
7 Minimum Cut Problem Min -t cut problem. Find an -t cut of minimum capacity. 3 t A 3 7 Capacity = + + = 7
8 Flow Def. An -t flow i a function that atifie: For each e E: For each v V {, t}: f (e) c(e) f (e) f (e) e in to v e out of v [capacity] [conervation] Def. The value of a flow f i: v( f ) f (e). e out of 3 t capacity flow 3 7 Value =
9 Flow Def. An -t flow i a function that atifie: For each e E: For each v V {, t}: f (e) c(e) f (e) f (e) e in to v e out of v [capacity] [conervation] Def. The value of a flow f i: v( f ) f (e). e out of 3 3 t capacity 1 flow Value =
10 Maximum Flow Problem Max flow problem. Find -t flow of maximum value. 1 3 t capacity flow Value =
11 Flow and Cut Flow value lemma. Let f be any flow, and let (A, B) be any -t cut. Then, the net flow ent acro the cut i equal to the amount leaving. f (e) f (e) v( f ) e out of A e in to A 3 3 t A Value = 11
12 Flow and Cut Flow value lemma. Let f be any flow, and let (A, B) be any -t cut. Then, the net flow ent acro the cut i equal to the amount leaving. f (e) f (e) v( f ) e out of A e in to A 3 3 t A Value = = 1
13 Flow and Cut Flow value lemma. Let f be any flow, and let (A, B) be any -t cut. Then, the net flow ent acro the cut i equal to the amount leaving. f (e) f (e) v( f ) e out of A e in to A 3 3 t A Value = = 13
14 Flow and Cut Flow value lemma. Let f be any flow, and let (A, B) be any -t cut. Then f (e) f (e) v( f ). e out of A e in to A Pf. by flow conervation, all term except v = are v( f ) f (e) e out of v A (by definition) f (e) f (e) e out of v e in to v f (e) f (e). e out of A e in to A 1
15 Flow and Cut Weak duality. Let f be any flow, and let (A, B) be any -t cut. Then the value of the flow i at mot the capacity of the cut. Cut capacity = 3 Flow value 3 3 t A 3 7 Capacity = 3
16 Flow and Cut Weak duality. Let f be any flow. Then, for any -t cut (A, B) we have v(f) cap(a, B). Pf. v( f ) f (e) f (e) e out of A e in to A f (e) e out of A c(e) e out of A cap(a, B) A 7 B t 1
17 Certificate of Optimality Corollary. Let f be any flow, and let (A, B) be any cut. If v(f) = cap(a, B), then f i a max flow and (A, B) i a min cut. Value of flow = Cut capacity = Flow value 1 3 t A
18 Toward a Max Flow Algorithm Greedy algorithm. Start with f(e) = for all edge e E. Find an -t path P where each edge ha f(e) < c(e). Augment flow along path P. Repeat until you get tuck. 1 3 t Flow value = 1
19 Toward a Max Flow Algorithm Greedy algorithm. Start with f(e) = for all edge e E. Find an -t path P where each edge ha f(e) < c(e). Augment flow along path P. Repeat until you get tuck. 1 X 3 X t X Flow value = 1
20 Toward a Max Flow Algorithm Greedy algorithm. Start with f(e) = for all edge e E. Find an -t path P where each edge ha f(e) < c(e). Augment flow along path P. Repeat until you get tuck. locally optimality global optimality t 3 t greedy = opt = 3
21 Reidual Graph Original edge: e = (u, v) E. Flow f(e), capacity c(e). u 17 capacity v flow Reidual edge. "Undo" flow ent. e = (u, v) and e R = (v, u). Reidual capacity: u 11 reidual capacity v c(e) f (e) c f (e) if f (e) e E if e R E reidual capacity Reidual graph: G f = (V, E f ). Reidual edge with poitive reidual capacity. E f = {e : f(e) < c(e)} {e R : f(e) > }. 1
22 7. Ford-Fulkeron Demo
23 Ford-Fulkeron Algorithm G: capacity 3 t 3
24 Ford-Fulkeron Algorithm G: flow capacity 3 t Flow value =
25 Ford-Fulkeron Algorithm G: X X flow capacity X 3 t Flow value = G f : reidual capacity 3 t
26 Ford-Fulkeron Algorithm G: X X X X 3 t Flow value = G f : 3 t
27 Ford-Fulkeron Algorithm G: X X X X 3 t Flow value = G f : 3 7 t 7
28 Ford-Fulkeron Algorithm G: X X X X 3 t Flow value = 1 G f : 3 1 t
29 Ford-Fulkeron Algorithm X 3 G: X 7 X X X 3 t Flow value = 1 G f : 3 1 t
30 Ford-Fulkeron Algorithm 3 G: 7 3 t Flow value = G f : t 3
31 Ford-Fulkeron Algorithm 3 G: 7 3 t Cut capacity = 1 Flow value = G f : t 31
32 Augmenting Path Algorithm Augment(f, c, P) { b bottleneck(p) foreach e P { } if (e E) f(e) f(e) + b ele f(e R ) f(e R ) - b } return f forward edge revere edge Ford-Fulkeron(G,, t, c) { foreach e E f(e) G f reidual graph } while (there exit augmenting path P) { f Augment(f, c, P) update G f } return f 3
33 Max-Flow Min-Cut Theorem Augmenting path theorem. Flow f i a max flow iff there are no augmenting path. Max-flow min-cut theorem. [Elia-Feintein-Shannon, Ford-Fulkeron ] The value of the max flow i equal to the value of the min cut. Pf. We prove both imultaneouly by howing TFAE (the following are equivalent): (i) There exit a cut (A, B) uch that v(f) = cap(a, B). (ii) Flow f i a max flow. (iii) There i no augmenting path relative to f. (i) (ii) Thi wa the corollary to weak duality lemma. (ii) (iii) We how contrapoitive. Let f be a flow. If there exit an augmenting path, then we can improve f by ending flow along path. 33
34 Proof of Max-Flow Min-Cut Theorem (iii) (i) Let f be a flow with no augmenting path. Let A be et of vertice reachable from in reidual graph. By definition of A, A. By definition of f, t A. v( f ) f (e) f (e) e out of A e in to A c(e) e out of A cap(a, B) A B t original network 3
35 Running Time Aumption. All capacitie are integer between 1 and C. Invariant. Every flow value f(e) and every reidual capacity c f (e) remain an integer throughout the algorithm. Theorem. The algorithm terminate in at mot v(f*) nc iteration. Pf. Each augmentation increae value by at leat 1. Corollary. If C = 1, Ford-Fulkeron run in O(mn) time. Integrality theorem. If all capacitie are integer, then there exit a max flow f for which every flow value f(e) i an integer. Pf. Since algorithm terminate, theorem follow from invariant. 3
36 Kleinberg HW 7.3 The figure how a flow network on which an -t flow ha been computed. The capacity of each edge appear a a label next to the edge, and the number in the boxe give the amount of flow ent on each edge (Edge without boxed number have no flow being ent on them). What i the value of thi flow? I thi a maximum (,t) flow in thi graph? 3
37 Kleinberg HW 7.3 The figure how a flow network on which an -t flow ha been computed. The capacity of each edge appear a a label next to the edge, and the number in the boxe give the amount of flow ent on each edge (Edge without boxed number have no flow being ent on them). What i the value of thi flow? I thi a maximum (,t) flow in thi graph? No. 37
38 Kleinberg HW 7.3 The figure how a flow network on which an -t flow ha been computed. The capacity of each edge appear a a label next to the edge, and the number in the boxe give the amount of flow ent on each edge (Edge without boxed number have no flow being ent on them). (b) Find a minimum -t cut in the flow network pictured, and alo ay what it capacity i. 3
39 Kleinberg HW 7.3 The figure how a flow network on which an -t flow ha been computed. The capacity of each edge appear a a label next to the edge, and the number in the boxe give the amount of flow ent on each edge (Edge without boxed number have no flow being ent on them). (b) Find a minimum -t cut in the flow network pictured, and alo ay what it capacity i. Min cut i: ({,a,b,c},{d,t}); the capacity i 11. 3
40 Kleinberg HW 7. Decide whether you think the following tate i true or fale. If it i true, give a hort explanation. If it i fale give a counter-example. Let G be an arbitrary flow network, with a ource, a ink t, and a poitive integer capacity c e on every edge; and let (A,B) be a minimum -t cut with repect to thee capacitie. Now uppoe we add 1 to every capacity; then (A,B) i till a minimum -t cut with repect to thee new capacitie.
41 Kleinberg HW 7. Decide whether you think the following tate i true or fale. If it i true, give a hort explanation. If it i fale give a counter-example. Let G be an arbitrary flow network, with a ource, a ink t, and a poitive integer capacity c e on every edge; and let (A,B) be a minimum -t cut with repect to thee capacitie. Now uppoe we add 1 to every capacity; then (A,B) i till a minimum -t cut with repect to thee new capacitie. Anwer: Fale. Conider a graph with node,v,w,t, and edge: (,v), (v,w), (w,t), capacitie of on (,v) and (w,t) and a capacity of 1 on (v,w). The maximum flow ha value 1, and doe not aturate the edge out of. 1
42 Kleinberg HW 7.7 Conider a et of mobile computing client in a certain town who each need to be connected to one of everal poible bae tation. We ll uppoe there are n client, with the poition of each client pecified by it (x,y) coordinate in the plane. There are alo k bae tation; the poition of each of thee i pecified by (x,y) coordinate a well. For each client, we wih to connect it to exactly one of the bae tation. Our choice of connection i contrained in the following way. There i a range parameter r: a client can only be connected to a bae tation that i within ditance r. There i alo a load parameter L: no more than L client can be connected to any ingle bae tation. Your goal i to deign a polynomial-time algorithm for the following problem. Give the poition of a et of bae tation, be connected imultaneouly to a bae tation, ubject to the range and load condition in the previou paragraph.
43 Kleinberg HW 7.7 There i a range parameter r: a client can only be connected to a bae tation that i within ditance r. There i alo a load parameter L: no more than L client can be connected to any ingle bae tation. Your goal i to deign a polynomial-time algorithm for the following problem. Give the poition of a et of bae tation, be connected imultaneouly to a bae tation, ubject to the range and load condition in the previou paragraph. 3
44 Kleinberg HW 7.7 There i a range parameter r: a client can only be connected to a bae tation that i within ditance r. There i alo a load parameter L: no more than L client can be connected to any ingle bae tation. Your goal i to deign a polynomial-time algorithm for the following problem. Give the poition of a et of bae tation, be connected imultaneouly to a bae tation, ubject to the range and load condition in the previou paragraph. Anwer: (getting tarted) Build the flow network a node v i for each client, a node w j for each bae and an edge (v i,w j ) of capacity 1 if client i i in range of bae tation j. Latly, expand thi graph by adding the ource node that connect to each of the client node with capacity 1, and we connect each of the bae tation to a ink node t by an edge of capacity L. Now how that there i a feaible way to connect all client to bae tation if and only if there i an -t flow of value n. Running time i time required to olve max-flow on graph with O(n+k) node and O(nk) edge
Algorithm 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 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 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 informationSoviet Rail Network, 1955
Ch7. Network Flow Soviet Rail Network, 955 Reference: On the history of the transportation and maximum flow problems. Alexander Schrijver in Math Programming, 9: 3, 2002. 2 Maximum Flow and Minimum Cut
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 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 informationCS4800: Algorithms & Data Jonathan Ullman
CS800: Algorithm & Data Jonathan Ullman Lecture 17: Network Flow Chooing Good Augmenting Path Mar 0, 018 Recap Directed graph! = #, % Two pecial node: ource & and ink = ' Edge capacitie ( ) 9 5 15 15 ource
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 informationAgenda. Soviet Rail Network, We ve done Greedy Method Divide and Conquer Dynamic Programming
Agenda We ve done Greedy Method Divide and Conquer Dynamic Programming Now Flow Networks, Max-flow Min-cut and Applications c Hung Q. Ngo (SUNY at Buffalo) CSE 531 Algorithm Analysis and Design 1 / 52
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 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 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 informationProblem Set 8 Solutions
Deign and Analyi of Algorithm April 29, 2015 Maachuett Intitute of Technology 6.046J/18.410J Prof. Erik Demaine, Srini Devada, and Nancy Lynch Problem Set 8 Solution Problem Set 8 Solution Thi problem
More informationAlgorithm Design and Analysis
Algorithm Design and Analysis LETURE 28 Network Flow hoosing good augmenting paths apacity scaling algorithm A. Smith /4/2008 A. Smith; based on slides by K. Wayne and S. Raskhodnikova Pre-break: Ford-Fulkerson
More informationCS 170: Midterm Exam II University of California at Berkeley Department of Electrical Engineering and Computer Sciences Computer Science Division
1 1 April 000 Demmel / Shewchuk CS 170: Midterm Exam II Univerity of California at Berkeley Department of Electrical Engineering and Computer Science Computer Science Diviion hi i a cloed book, cloed calculator,
More informationRunning Time. Assumption. All capacities are integers between 1 and C.
Running Time Assumption. All capacities are integers between and. Invariant. Every flow value f(e) and every residual capacities c f (e) remains an integer throughout the algorithm. Theorem. The algorithm
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 informationdirected weighted graphs as flow networks the Ford-Fulkerson algorithm termination and running time
Network Flow 1 The Maximum-Flow Problem directed weighted graphs as flow networks the Ford-Fulkerson algorithm termination and running time 2 Maximum Flows and Minimum Cuts flows and cuts max flow equals
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 informationUndirected Graphs. V = { 1, 2, 3, 4, 5, 6, 7, 8 } E = { 1-2, 1-3, 2-3, 2-4, 2-5, 3-5, 3-7, 3-8, 4-5, 5-6 } n = 8 m = 11
Undirected Graphs Undirected graph. G = (V, E) V = nodes. E = edges between pairs of nodes. Captures pairwise relationship between objects. Graph size parameters: n = V, m = E. V = {, 2, 3,,,, 7, 8 } E
More informationMax Flow: Algorithms and Applications
Max Flow: Algorithms and Applications Outline for today Quick review of the Max Flow problem Applications of Max Flow The Ford-Fulkerson (FF) algorithm for Max Flow Analysis of FF, and the Max Flow Min
More informationLecture 21. The Lovasz splitting-off lemma Topics in Combinatorial Optimization April 29th, 2004
18.997 Topic in Combinatorial Optimization April 29th, 2004 Lecture 21 Lecturer: Michel X. Goeman Scribe: Mohammad Mahdian 1 The Lovaz plitting-off lemma Lovaz plitting-off lemma tate the following. Theorem
More informationAlgorithms: Lecture 12. Chalmers University of Technology
Algorithms: Lecture 1 Chalmers University of Technology Today s Topics Shortest Paths Network Flow Algorithms Shortest Path in a Graph Shortest Path Problem Shortest path network. Directed graph G = (V,
More informationAlgorithm Design and Analysis
Algorithm Design and Analysis LETURE 2 Network Flow Finish bipartite matching apacity-scaling algorithm Adam Smith 0//0 A. Smith; based on slides by E. Demaine,. Leiserson, S. Raskhodnikova, K. Wayne Marriage
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 informationChapter Landscape of an Optimization Problem. Local Search. Coping With NP-Hardness. Gradient Descent: Vertex Cover
Coping With NP-Hardne Chapter 12 Local Search Q Suppoe I need to olve an NP-hard problem What hould I do? A Theory ay you're unlikely to find poly-time algorithm Mut acrifice one of three deired feature
More informationList coloring hypergraphs
Lit coloring hypergraph Penny Haxell Jacque Vertraete Department of Combinatoric and Optimization Univerity of Waterloo Waterloo, Ontario, Canada pehaxell@uwaterloo.ca Department of Mathematic Univerity
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 informationBalanced Network Flows
revied, June, 1992 Thi paper appeared in Bulletin of the Intitute of Combinatoric and it Application 7 (1993), 17-32. Balanced Network Flow William Kocay* and Dougla tone Department of Computer cience
More information4. Connectivity Connectivity Connectivity. Whitney's s connectivity theorem: (G) (G) (G) for special
4. Connectivity 4.. Connectivity Vertex-cut and vertex-connectivity Edge-cut and edge-connectivty Whitney' connectivity theorem: Further theorem for the relation of and graph 4.. The Menger Theorem and
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 informationSuggested Answers To Exercises. estimates variability in a sampling distribution of random means. About 68% of means fall
Beyond Significance Teting ( nd Edition), Rex B. Kline Suggeted Anwer To Exercie Chapter. The tatitic meaure variability among core at the cae level. In a normal ditribution, about 68% of the core fall
More informationMinimum Cost Noncrossing Flow Problem on Layered Networks
Minimum Cot Noncroing Flow Problem on Layered Network İ. Kuban Altınel*, Necati Ara, Zeynep Şuvak, Z. Caner Taşkın Department of Indutrial Engineering, Boğaziçi Univerity, 44, Bebek, İtanbul, Turkey Abtract
More informationMaximum flow problem CE 377K. February 26, 2015
Maximum flow problem CE 377K February 6, 05 REVIEW HW due in week Review Label setting vs. label correcting Bellman-Ford algorithm Review MAXIMUM FLOW PROBLEM Maximum Flow Problem What is the greatest
More informationPhysics 741 Graduate Quantum Mechanics 1 Solutions to Final Exam, Fall 2014
Phyic 7 Graduate Quantum Mechanic Solution to inal Eam all 0 Each quetion i worth 5 point with point for each part marked eparately Some poibly ueful formula appear at the end of the tet In four dimenion
More informationBogoliubov Transformation in Classical Mechanics
Bogoliubov Tranformation in Claical Mechanic Canonical Tranformation Suppoe we have a et of complex canonical variable, {a j }, and would like to conider another et of variable, {b }, b b ({a j }). How
More informationAlgorithm Design and Analysis
Algorithm Design and Analysis LECTURE 7 Network Flow Application: Bipartite Matching Adam Smith 0//008 A. Smith; based on slides by S. Raskhodnikova and K. Wayne Recently: Ford-Fulkerson Find max s-t flow
More informationρ water = 1000 kg/m 3 = 1.94 slugs/ft 3 γ water = 9810 N/m 3 = 62.4 lbs/ft 3
CEE 34 Aut 004 Midterm # Anwer all quetion. Some data that might be ueful are a follow: ρ water = 1000 kg/m 3 = 1.94 lug/ft 3 water = 9810 N/m 3 = 6.4 lb/ft 3 1 kw = 1000 N-m/ 1. (10) A 1-in. and a 4-in.
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 informationSOME RESULTS ON INFINITE POWER TOWERS
NNTDM 16 2010) 3, 18-24 SOME RESULTS ON INFINITE POWER TOWERS Mladen Vailev - Miana 5, V. Hugo Str., Sofia 1124, Bulgaria E-mail:miana@abv.bg Abtract To my friend Kratyu Gumnerov In the paper the infinite
More informationPhysics 2212 G Quiz #2 Solutions Spring 2018
Phyic 2212 G Quiz #2 Solution Spring 2018 I. (16 point) A hollow inulating phere ha uniform volume charge denity ρ, inner radiu R, and outer radiu 3R. Find the magnitude of the electric field at a ditance
More informationChapter 7. Network Flow. Slides by Kevin Wayne. Copyright 2005 Pearson-Addison Wesley. All rights reserved.
Chapter 7 Network Flow Slides by Kevin Wayne. Copyright 2005 Pearson-Addison Wesley. All rights reserved. 7.5 Bipartite Matching Matching Matching. Input: undirected graph G = (V, E). M E is a matching
More informationLayering as Optimization Decomposition
TLEN7000/ECEN7002: Analytical Foundation of Network Layering a Optimization Decompoition Lijun Chen 11/29/2012 The Internet Compleity i ever increaing Large in ize and cope Enormou heterogeneity Incomplete
More informationFair Game Review. Chapter 7 A B C D E Name Date. Complete the number sentence with <, >, or =
Name Date Chapter 7 Fair Game Review Complete the number entence with , or =. 1. 3.4 3.45 2. 6.01 6.1 3. 3.50 3.5 4. 0.84 0.91 Find three decimal that make the number entence true. 5. 5.2 6. 2.65 >
More informationCSC 373: Algorithm Design and Analysis Lecture 12
CSC 373: Algorithm Design and Analysis Lecture 12 Allan Borodin February 4, 2013 1 / 16 Lecture 12: Announcements and Outline Announcements Term test 1 in tutorials. Need to use only two rooms due to sickness
More informationHybrid Control and Switched Systems. Lecture #6 Reachability
Hbrid Control and Switched Stem Lecture #6 Reachabilit João P. Hepanha Univerit of California at Santa Barbara Summar Review of previou lecture Reachabilit tranition tem reachabilit algorithm backward
More information7.5 Bipartite Matching
7. Bipartite Matching Matching Matching. Input: undirected graph G = (V, E). M E is a matching if each node appears in at most edge in M. Max matching: find a max cardinality matching. Bipartite Matching
More informationSIMPLE LINEAR REGRESSION
SIMPLE LINEAR REGRESSION In linear regreion, we conider the frequency ditribution of one variable (Y) at each of everal level of a econd variable (). Y i known a the dependent variable. The variable for
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 information11.2 Stability. A gain element is an active device. One potential problem with every active circuit is its stability
5/7/2007 11_2 tability 1/2 112 tability eading Aignment: pp 542-548 A gain element i an active device One potential problem with every active circuit i it tability HO: TABIITY Jim tile The Univ of Kana
More informationCodes Correcting Two Deletions
1 Code Correcting Two Deletion Ryan Gabry and Frederic Sala Spawar Sytem Center Univerity of California, Lo Angele ryan.gabry@navy.mil fredala@ucla.edu Abtract In thi work, we invetigate the problem of
More informationTwo Applications of Maximum Flow
Two Applications of Maximum Flow The Bipartite Matching Problem a bipartite graph as a flow network maximum flow and maximum matching alternating paths perfect matchings 2 Circulation with Demands flows
More informationSocial Studies 201 Notes for March 18, 2005
1 Social Studie 201 Note for March 18, 2005 Etimation of a mean, mall ample ize Section 8.4, p. 501. When a reearcher ha only a mall ample ize available, the central limit theorem doe not apply to the
More informationFlows and Cuts. 1 Concepts. CS 787: Advanced Algorithms. Instructor: Dieter van Melkebeek
CS 787: Advanced Algorithms Flows and Cuts Instructor: Dieter van Melkebeek This lecture covers the construction of optimal flows and cuts in networks, their relationship, and some applications. It paves
More informationLINEAR ALGEBRA METHOD IN COMBINATORICS. Theorem 1.1 (Oddtown theorem). In a town of n citizens, no more than n clubs can be formed under the rules
LINEAR ALGEBRA METHOD IN COMBINATORICS 1 Warming-up example Theorem 11 (Oddtown theorem) In a town of n citizen, no more tha club can be formed under the rule each club have an odd number of member each
More informationMyriad of applications
Shortet Path Myriad of application Finding hortet ditance between location (Google map, etc.) Internet router protocol: OSPF (Open Shortet Path Firt) i ued to find the hortet path to interchange package
More informationSocial Studies 201 Notes for November 14, 2003
1 Social Studie 201 Note for November 14, 2003 Etimation of a mean, mall ample ize Section 8.4, p. 501. When a reearcher ha only a mall ample ize available, the central limit theorem doe not apply to the
More informationCHAPTER 6. Estimation
CHAPTER 6 Etimation Definition. Statitical inference i the procedure by which we reach a concluion about a population on the bai of information contained in a ample drawn from that population. Definition.
More informationAn Interesting Property of Hyperbolic Paraboloids
Page v w Conider the generic hyperbolic paraboloid defined by the equation. u = where a and b are aumed a b poitive. For our purpoe u, v and w are a permutation of x, y, and z. A typical graph of uch a
More informationUNIT 15 RELIABILITY EVALUATION OF k-out-of-n AND STANDBY SYSTEMS
UNIT 1 RELIABILITY EVALUATION OF k-out-of-n AND STANDBY SYSTEMS Structure 1.1 Introduction Objective 1.2 Redundancy 1.3 Reliability of k-out-of-n Sytem 1.4 Reliability of Standby Sytem 1. Summary 1.6 Solution/Anwer
More informationElectronic Theses and Dissertations
Eat Tenneee State Univerity Digital Common @ Eat Tenneee State Univerity Electronic Thee and Diertation Student Work 5-208 Vector Partition Jennifer French Eat Tenneee State Univerity Follow thi and additional
More informationMarch 18, 2014 Academic Year 2013/14
POLITONG - SHANGHAI BASIC AUTOMATIC CONTROL Exam grade March 8, 4 Academic Year 3/4 NAME (Pinyin/Italian)... STUDENT ID Ue only thee page (including the back) for anwer. Do not ue additional heet. Ue of
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 informationQuestion 1 Equivalent Circuits
MAE 40 inear ircuit Fall 2007 Final Intruction ) Thi exam i open book You may ue whatever written material you chooe, including your cla note and textbook You may ue a hand calculator with no communication
More informationMath 273 Solutions to Review Problems for Exam 1
Math 7 Solution to Review Problem for Exam True or Fale? Circle ONE anwer for each Hint: For effective tudy, explain why if true and give a counterexample if fale (a) T or F : If a b and b c, then a c
More informationECE Linear Circuit Analysis II
ECE 202 - Linear Circuit Analyi II Final Exam Solution December 9, 2008 Solution Breaking F into partial fraction, F 2 9 9 + + 35 9 ft δt + [ + 35e 9t ]ut A 9 Hence 3 i the correct anwer. Solution 2 ft
More information7. NETWORK FLOW II. bipartite matching disjoint paths extensions to max flow 3D Memory Reliability survey design airline scheduling image segmentation
7. NETWORK FLOW II bipartite matching disjoint paths extensions to max flow 3D Memory Reliability survey design airline scheduling image segmentation Lecture slides by Kevin Wayne Copyright 2005 Pearson-Addison
More informationChapter 7. Network Flow. Slides by Kevin Wayne. Copyright 2005 Pearson-Addison Wesley. All rights reserved.
Chapter 7 Network Flow Slides by Kevin Wayne. Copyright 2005 Pearson-Addison Wesley. All rights reserved. 7.5 Bipartite Matching Matching Matching. Input: undirected graph G = (V, E). M E is a matching
More informationAssignment for Mathematics for Economists Fall 2016
Due date: Mon. Nov. 1. Reading: CSZ, Ch. 5, Ch. 8.1 Aignment for Mathematic for Economit Fall 016 We now turn to finihing our coverage of concavity/convexity. There are two part: Jenen inequality for concave/convex
More informationON A CERTAIN FAMILY OF QUARTIC THUE EQUATIONS WITH THREE PARAMETERS. Volker Ziegler Technische Universität Graz, Austria
GLASNIK MATEMATIČKI Vol. 1(61)(006), 9 30 ON A CERTAIN FAMILY OF QUARTIC THUE EQUATIONS WITH THREE PARAMETERS Volker Ziegler Techniche Univerität Graz, Autria Abtract. We conider the parameterized Thue
More informationLearning Multiplicative Interactions
CSC2535 2011 Lecture 6a Learning Multiplicative Interaction Geoffrey Hinton Two different meaning of multiplicative If we take two denity model and multiply together their probability ditribution at each
More informationALLOCATING BANDWIDTH FOR BURSTY CONNECTIONS
SIAM J. COMPUT. Vol. 30, No. 1, pp. 191 217 c 2000 Society for Indutrial and Applied Mathematic ALLOCATING BANDWIDTH FOR BURSTY CONNECTIONS JON KLEINBERG, YUVAL RABANI, AND ÉVA TARDOS Abtract. In thi paper,
More informationON A CERTAIN FAMILY OF QUARTIC THUE EQUATIONS WITH THREE PARAMETERS
ON A CERTAIN FAMILY OF QUARTIC THUE EQUATIONS WITH THREE PARAMETERS VOLKER ZIEGLER Abtract We conider the parameterized Thue equation X X 3 Y (ab + (a + bx Y abxy 3 + a b Y = ±1, where a, b 1 Z uch that
More informationarxiv: v1 [math.mg] 25 Aug 2011
ABSORBING ANGLES, STEINER MINIMAL TREES, AND ANTIPODALITY HORST MARTINI, KONRAD J. SWANEPOEL, AND P. OLOFF DE WET arxiv:08.5046v [math.mg] 25 Aug 20 Abtract. We give a new proof that a tar {op i : i =,...,
More informationMulticolor Sunflowers
Multicolor Sunflower Dhruv Mubayi Lujia Wang October 19, 2017 Abtract A unflower i a collection of ditinct et uch that the interection of any two of them i the ame a the common interection C of all of
More informationTime-Optimal Trajectory Planning Along Predefined Path for Mobile Robots with Velocity and Acceleration Constraints
Time-Optimal Trajectory Planning Along Predefined Path for Mobile Robot with Velocity and Acceleration Contraint Mišel Brezak and Ivan Petrović Abtract Thi paper i concerned with the problem of finding
More informationChapter 7. Root Locus Analysis
Chapter 7 Root Locu Analyi jw + KGH ( ) GH ( ) - K 0 z O 4 p 2 p 3 p Root Locu Analyi The root of the cloed-loop characteritic equation define the ytem characteritic repone. Their location in the complex
More informationClustering Methods without Given Number of Clusters
Clutering Method without Given Number of Cluter Peng Xu, Fei Liu Introduction A we now, mean method i a very effective algorithm of clutering. It mot powerful feature i the calability and implicity. However,
More informationMATEMATIK Datum: Tid: eftermiddag. A.Heintz Telefonvakt: Anders Martinsson Tel.:
MATEMATIK Datum: 20-08-25 Tid: eftermiddag GU, Chalmer Hjälpmedel: inga A.Heintz Telefonvakt: Ander Martinon Tel.: 073-07926. Löningar till tenta i ODE och matematik modellering, MMG5, MVE6. Define what
More informationAlgorithm Design and Analysis
Algorithm Design and Analysis LECTURE 22 Maximum Flow Applications Image segmentation Project selection Extensions to Max Flow Sofya Raskhodnikova 11/07/2016 S. Raskhodnikova; based on slides by E. Demaine,
More informationComparing Means: t-tests for Two Independent Samples
Comparing ean: t-tet for Two Independent Sample Independent-eaure Deign t-tet for Two Independent Sample Allow reearcher to evaluate the mean difference between two population uing data from two eparate
More informationDTM: A Distributed Traffic Management Algorithm for Sensor Networks
8 IJCSNS International Journal of Computer Science Network Security, VOL6 No8A, Augut 6 DM: A Ditributed raffic Management Algorithm for Senor Network Yantao Pan, Xicheng Lu, Peidong Zhu School of Computer,
More informationZ a>2 s 1n = X L - m. X L = m + Z a>2 s 1n X L = The decision rule for this one-tail test is
M09_BERE8380_12_OM_C09.QD 2/21/11 3:44 PM Page 1 9.6 The Power of a Tet 9.6 The Power of a Tet 1 Section 9.1 defined Type I and Type II error and their aociated rik. Recall that a repreent the probability
More informationFermi Distribution Function. n(e) T = 0 T > 0 E F
LECTURE 3 Maxwell{Boltzmann, Fermi, and Boe Statitic Suppoe we have a ga of N identical point particle in a box ofvolume V. When we ay \ga", we mean that the particle are not interacting with one another.
More informationTRIPLE SOLUTIONS FOR THE ONE-DIMENSIONAL
GLASNIK MATEMATIČKI Vol. 38583, 73 84 TRIPLE SOLUTIONS FOR THE ONE-DIMENSIONAL p-laplacian Haihen Lü, Donal O Regan and Ravi P. Agarwal Academy of Mathematic and Sytem Science, Beijing, China, National
More informationExample: Amplifier Distortion
4/6/2011 Example Amplifier Ditortion 1/9 Example: Amplifier Ditortion Recall thi circuit from a previou handout: 15.0 R C =5 K v ( t) = v ( t) o R B =5 K β = 100 _ vi( t ) 58. R E =5 K CUS We found that
More informationTAYLOR POLYNOMIALS FOR NABLA DYNAMIC EQUATIONS ON TIME SCALES
TAYLOR POLYNOMIALS FOR NABLA DYNAMIC EQUATIONS ON TIME SCALES DOUGLAS R. ANDERSON Abtract. We are concerned with the repreentation of polynomial for nabla dynamic equation on time cale. Once etablihed,
More informationProblem set 1. (c) Is the Ford-Fulkerson algorithm guaranteed to produce an acyclic maximum flow?
CS261, Winter 2017. Instructor: Ashish Goel. Problem set 1 Electronic submission to Gradescope due 11:59pm Thursday 2/2. Form a group of 2-3 students that is, submit one homework with all of your names.
More information7.2 INVERSE TRANSFORMS AND TRANSFORMS OF DERIVATIVES 281
72 INVERSE TRANSFORMS AND TRANSFORMS OF DERIVATIVES 28 and i 2 Show how Euler formula (page 33) can then be ued to deduce the reult a ( a) 2 b 2 {e at co bt} {e at in bt} b ( a) 2 b 2 5 Under what condition
More informationCONTROL SYSTEMS. Chapter 5 : Root Locus Diagram. GATE Objective & Numerical Type Solutions. The transfer function of a closed loop system is
CONTROL SYSTEMS Chapter 5 : Root Locu Diagram GATE Objective & Numerical Type Solution Quetion 1 [Work Book] [GATE EC 199 IISc-Bangalore : Mark] The tranfer function of a cloed loop ytem i T () where i
More informationFlow Network. The following figure shows an example of a flow network:
Maximum Flow 1 Flow Network The following figure shows an example of a flow network: 16 V 1 12 V 3 20 s 10 4 9 7 t 13 4 V 2 V 4 14 A flow network G = (V,E) is a directed graph. Each edge (u, v) E has a
More informationSERIES COMPENSATION: VOLTAGE COMPENSATION USING DVR (Lectures 41-48)
Chapter 5 SERIES COMPENSATION: VOLTAGE COMPENSATION USING DVR (Lecture 41-48) 5.1 Introduction Power ytem hould enure good quality of electric power upply, which mean voltage and current waveform hould
More informationPreemptive scheduling on a small number of hierarchical machines
Available online at www.ciencedirect.com Information and Computation 06 (008) 60 619 www.elevier.com/locate/ic Preemptive cheduling on a mall number of hierarchical machine György Dóa a, Leah Eptein b,
More informationPrimitive Digraphs with the Largest Scrambling Index
Primitive Digraph with the Larget Scrambling Index Mahmud Akelbek, Steve Kirkl 1 Department of Mathematic Statitic, Univerity of Regina, Regina, Sakatchewan, Canada S4S 0A Abtract The crambling index of
More informationOptimal Coordination of Samples in Business Surveys
Paper preented at the ICES-III, June 8-, 007, Montreal, Quebec, Canada Optimal Coordination of Sample in Buine Survey enka Mach, Ioana Şchiopu-Kratina, Philip T Rei, Jean-Marc Fillion Statitic Canada New
More informationFair Game Review. Chapter 6. Evaluate the expression. 3. ( ) 7. Find ± Find Find Find the side length s of the square.
Name Date Chapter 6 Evaluate the epreion. Fair Game Review 1. 5 1 6 3 + 8. 18 9 + 0 5 3 3 1 + +. 9 + 7( 8) + 5 0 + ( 6 8) 1 3 3 3. ( ) 5. Find 81. 6. Find 5. 7. Find ± 16. 8. Find the ide length of the
More informationUSPAS Course on Recirculated and Energy Recovered Linear Accelerators
USPAS Coure on Recirculated and Energy Recovered Linear Accelerator G. A. Krafft and L. Merminga Jefferon Lab I. Bazarov Cornell Lecture 6 7 March 005 Lecture Outline. Invariant Ellipe Generated by a Unimodular
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 informationUNIQUE CONTINUATION FOR A QUASILINEAR ELLIPTIC EQUATION IN THE PLANE
UNIQUE CONTINUATION FOR A QUASILINEAR ELLIPTIC EQUATION IN THE PLANE SEPPO GRANLUND AND NIKO MAROLA Abtract. We conider planar olution to certain quailinear elliptic equation ubject to the Dirichlet boundary
More informationNOTE: The items d) and e) of Question 4 gave you bonus marks.
MAE 40 Linear ircuit Summer 2007 Final Solution NOTE: The item d) and e) of Quetion 4 gave you bonu mark. Quetion [Equivalent irciut] [4 mark] Find the equivalent impedance between terminal A and B in
More information