L07-mincut - Minimum Cost Flow and Minimum Cut Lecture 7:...

Info iconThis preview shows pages 1–9. Sign up to view the full content.

View Full Document Right Arrow Icon
1 Minimum Cost Flow and Minimum Cut Lecture 7: Jan 31
Background image of page 1

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
2 Flows    An  s-t   flow is a function  f   on the edges which satisfies: (capacity constraint)     (conservation of flows)    Value of the flow
Background image of page 2
3 Minimum Cost Flows Goal: Build a cheap network to satisfy the flow requirement.  A directed graph  G    A source vertex  s    A sink vertex    A capacity function  c  on the edges, i.e.  c:E->R  A cost function  w  on the edges, i.e.  w:E->R    A flow requirement  k Output: an  s-t   flow  f   of value k which  minimizes  f(e) w(e)  Σ Input:
Background image of page 3

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
4 Special cases Shortest path : find a shortest path between  s   and  t     A minimum cost flow with  k = 1   Maximum flow : find a maximum flow between  s   and  t   Every edge in the original graph has cost  0 . Disjoint paths : connect  s   and  t   by  k    paths with min # of edges   Every edge in the original graph has cost  1  and capacity  1 .
Background image of page 4
5 Stuctures Recap Bipartite matchings Maximum flows  Shortest paths Minimum Cost Flows M-augmenting paths Residual graph augmenting paths ??? Weighted Bipartite matchings Negative cycle, Shorest augmenting path
Background image of page 5

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
6 Residual Graph c(e) = 10 f(e) = 2 c(e) = 8 c(e) = 2 How about the  cost  of the flow?
Background image of page 6
7 Residual Graph c(e) = 10 f(e) = 2 c(e) = 8 c(e) = 2 c(e) = 10, w(e) f(e) = 2 c(e) = 8, w(e) c(e) = 2, -w(e) Max Flow Min-cost Flow
Background image of page 7

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
8 Weighted Bipartite Matching
Background image of page 8
Image of page 9
This is the end of the preview. Sign up to access the rest of the document.

Page1 / 26

L07-mincut - Minimum Cost Flow and Minimum Cut Lecture 7:...

This preview shows document pages 1 - 9. Sign up to view the full document.

View Full Document Right Arrow Icon
Ask a homework question - tutors are online