1 / 16

CSE 202 Network flow IV

CSE 202 Network flow IV. Fan Chung Graham UC San Diego. Flow Network: Oil Through Pipelines. A. D. How much oil can be shipped from S to T ?. 2. 5. 3. 2. 2. T. S. B. 1. 10. 1. 4. 6. C. E. Directed graph G = (V,E) Identified source S and sink T

sailor
Télécharger la présentation

CSE 202 Network flow IV

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript

  1. CSE 202 Network flow IV Fan Chung Graham UC San Diego

  2. Flow Network: Oil Through Pipelines A D How much oil can be shipped from S to T ? 2 5 3 2 2 T S B 1 10 1 4 6 C E • Directed graph G = (V,E) • Identified sourceS and sinkT • Edge capacitiesce

  3. Max Flow in the Network A D How much oil can be shipped from S to T ? 2/2 4/5 2/3 0/2 T 2/2 S B 0/1 2/10 1/1 5 units of flow – is this the maximum possible? 1/4 1/6 C E • Directed graph G = (V,E) • Identified sourceS and sinkT • Edge capacitiesce • The flow along an edge is ≤capacity. • Conservation of the flow in internal nodes.

  4. Max Flow in the Network A D 2/2 4/5 2/3 0/2 T 2/2 2 units of s-t flow S B 0/1 2/10 1/1 1 unit of s-t flow 1/4 1/6 C E Finding maximum flow • Ford – Fulkerson algorithm Finding augumenting paths in residual graphs or stop with a max-flow, validated by a min-cut. • variations

  5. Max Flow in the Network A D 2/2 4/5 2/3 0/2 T 2/2 2 units of s-t flow S B 0/1 2/10 1/1 1 unit of s-t flow 1/4 1/6 C E Finding maximum flow • Ford – Fulkerson algorithm Finding augumenting paths in residual graphs or stop with a max-flow, validated by a min-cut. • variations

  6. Max Flow in the Network • Two main variations • Circulation with demand • Capacity with lower bound

  7. An application in data mining– survey design • Customers • Products Design individualized survey for each customer i so that: • The survey concerns products he/she purchased. • Survey is not too long, with length • Product j is in y surveys where

  8. An application in data mining– survey design Design individualized survey for each customer i so that: • The survey concerns products he/she purchased. • Survey is not too long, with length • Product j is in y surveys where A D 1 1,5 2,3 T 1 1,5 1 S B E 1,3 2,3 1,4 1 C F

  9. Max Flow in the Network • Two main variations • Circulation with demand • Capacity with lower bound

  10. Max Flow in the Network Circulation with demand For a graph G and demands satisfying want to find • Capacity condition • Demand condition Solve it using max-flow !

  11. Circulation with demand For a graph G and demands satisfying want to find • Capacity condition • Demand condition -3 3 2 2 3 2 G -3 2 4

  12. Circulation with demand For a graph G and demands satisfying want to find • Capacity condition • Demand condition -3 3 2 2 3 T 2 3 2 G S -3 3 4 Solved. 2 4

  13. Capacity with lower bound For a (s,t)-network G satisfying want to find • Capacity condition • Conservation A D 1 1,5 2,3 T 1 1,5 1 S B E 1,3 2,3 1,4 1 C F

  14. Capacity with lower bound A D 1 1,5 2,3 T 1 1,5 1 S B E 1,3 2,3 1,4 1 C F 6 A D -2 1 1 1,5 2,3 1 4 1 1 T 1,5 1 -4 4 1 S B E 1 -1 1 1,3 4 2,3 2 1 1,4 3 1 C F 1 -1 2

  15. Circulation with demand For a graph G and demands satisfying want to find • Capacity condition • Demand condition A D 1 1,5 2,3 T 1 1,5 1 S B E 1,3 2,3 1,4 1 C F

More Related