Network Algorithms Maximum Flow - Department of Information 网络最大流算法-信息部.pptVIP

Network Algorithms: Maximum flow Maximum flow Network Algorithms 2005 Today Maximum flow problem Applications Briefly: Ford-Fulkerson; min cut max flow theorem Preflow push algorithm Lift to front algorithm Variants Problem Directed graph G=(V,E) Source s ? V, sink t ? V. Capacity c(e) ? Z+ for each e. Flow: function f: E ? N such that For all e: f(e) ￡ c(e) For all v, except s and t: flow into v equals flow out of v Flow value: flow out of s Question: find flow from s to t with maximum value Maximum flow Ford-Fulkerson method Possibly (not likely) exponential time Edmonds-Karp version: O(nm2): augment over shortest path from s to t Max Flow Min Cut Theorem Improved algorithms: Preflow push; scaling Applications Variants of the maximum flow problem Variant Multiple sources, multiple sinks Possible maximum flow out of certain sources or into some sinks Models logistic questions Lower bounds on flow Edges with minimum and maximum capacity For all e: l(e) ￡ f(e) ￡ c(e) Applications Logistics (transportation of goods) Matching Matrix rounding problem … Matrix rounding problem p * q matrix of real numbers D = {dij}, with row sums ai and column sums bj. Consistent rounding: round every dij up or down to integer, such that every row sum and column sum equals rounded sum of original matrix Can be modeled as flow problem with lower and upper bounds on flow through edges Ford-Fulkerson Residual network Gf Start with 0 flow Repeat Compute residual network Find path P from s to t in residual network Augment flow across P Until no such path P exists Max flow min cut theorem s-t-cut: partition vertices in sets S, T such that s in S, t in T. Look to edges (v,w) with v in S, w in T. Capacity of cut: sum of capacities of edges from S to T Flow across cut Theorem: minimum capacity of s-t-cut equals maximum flow from s to t. Preflow push Simple implementation: O(n2m) Better implementation: O(n3) Algorithm maintains preflow: some flow out of s which doesn’t reach t Vertices have heigh