7. NETWORK FLOW II. bipartite matching disjoint paths extensions to max flow 3D Memory Reliability survey design airline scheduling image segmentation

Transcription

1 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 Wesley project selection baseball elimination Last updated on 5/9/2 下午 0:43

2 Soviet rail network (950s) "Free world" goal. Cut supplies (if cold war turns into real war). Reference: On the history of the transportation and maximum flow problems. Alexander Schrijver in Math Programming, 9: 3,

3 Max-flow and min-cut applications Max-flow and min-cut are widely applicable problem-solving model. Data mining. Open-pit mining. Bipartite matching. Network reliability. Baseball elimination. Image segmentation. Network connectivity. Distributed computing. Security of statistical data. Egalitarian stable matching. Network intrusion detection. Multi-camera scene reconstruction. Sensor placement for homeland security. Many, many, more. liver and hepatic vascularization segmentation 3

4 7. NETWORK FLOW II bipartite matching disjoint paths extensions to max flow 3D Memory Reliability survey design airline scheduling image segmentation project selection baseball elimination

5 Matching Def. Given an undirected graph G = (V, E) a subset of edges M E is a matching if each node appears in at most one edge in M. Max matching. Given a graph, find a max cardinality matching. 5

6 Bipartite matching Def. A graph G is bipartite if the nodes can be partitioned into two subsets L and R such that every edge connects a node in L to one in R. Bipartite matching. Given a bipartite graph G = (L R, E), find a max cardinality matching. ' 2 2' 3 3' 4 4' L 5 5' R matching: -2', 3-', 4-5' 6

7 Bipartite matching Def. A graph G is bipartite if the nodes can be partitioned into two subsets L and R such that every edge connects a node in L to one in R. Bipartite matching. Given a bipartite graph G = (L R, E), find a max cardinality matching. ' 2 2' 3 3' 4 4' L 5 5' R matching: -', 2-2', 3-4', 4-5' 7

8 Bipartite matching: max flow formulation Create digraph G' = (L R {s, t}, E' ). Direct all edges from L to R, and assign infinite (or unit) capacity. Add source s, and unit capacity edges from s to each node in L. Add sink t, and unit capacity edges from each node in R to t. G' ' 2 2' s 3 3' t 4 4' 5 5' L R 8

9 Max flow formulation: proof of correctness Theorem. Max cardinality of a matching in G = value of max flow in G'. Pf. Given a max matching M of cardinality k. Consider flow f that sends unit along each of k paths. f is a flow, and has value k. ' ' 2 2' 2 2' 3 3' s 3 3' t 4 4' 4 4' G 5 5' 5 5' G' 9

10 Max flow formulation: proof of correctness Theorem. Max cardinality of a matching in G = value of max flow in G'. Pf. Let f be a max flow in G' of value k. Integrality theorem k is integral and can assume f is 0-. Consider M = set of edges from L to R with f (e) =. each node in L and R participates in at most one edge in M M = k: consider cut (L s, R t) ' ' 2 2' 2 2' s 3 3' t 3 3' 4 4' 4 4' G' 5 5' 5 5' G 0

11 Perfect matching in a bipartite graph Def. Given a graph G = (V, E) a subset of edges M E is a perfect matching if each node appears in exactly one edge in M. Q. When does a bipartite graph have a perfect matching? Structure of bipartite graphs with perfect matchings. Clearly we must have L = R. What other conditions are necessary? What conditions are sufficient?

12 Perfect matching in a bipartite graph Notation. Let S be a subset of nodes, and let N(S) be the set of nodes adjacent to nodes in S. Observation. If a bipartite graph G = (L R, E) has a perfect matching, then N(S) S for all subsets S L. Pf. Each node in S has to be matched to a different node in N(S). ' S = { 2, 4, 5 } N(S) = { 2', 5' } 2 3 2' 3' 4 4' 5 5' no perfect matching 2

13 Hall's theorem Theorem. Let G = (L R, E) be a bipartite graph with L = R. G has a perfect matching iff N(S) S for all subsets S L. Pf. This was the previous observation. ' S = { 2, 4, 5 } N(S) = { 2', 5' } 2 3 2' 3' 4 4' 5 5' no perfect matching 3

14 Proof of Hall's theorem s Pf. Suppose G does not have a perfect matching. Formulate as a max flow problem and let (A, B) be min cut in G'. By max-flow min-cut theorem, cap(a, B) < L. Define L A = L A, L B = L B, R A = R A. cap(a, B) = L B + R A. Since min cut can't use edges: N(L A ) R A. N(L A ) R A = cap(a, B) L B < L L B = L A. Choose S = L A. G' A 2 2' 3' ' LA = {2, 4, 5} LB = {, 3} RA = {2', 5'} N(LA) = {2', 5'} 4 3 4' 5 5' t 4

15 Bipartite matching running time Theorem. The Ford-Fulkerson algorithm solves the bipartite matching problem in O(m n) time. Theorem. [Hopcroft-Karp 973] The bipartite matching problem can be solved in O(m n /2 ) time. 5

16 Nonbipartite matching Nonbipartite matching. Given an undirected graph (not necessarily bipartite), find a matching of maximum cardinality. Structure of nonbipartite graphs is more complicated. But well-understood. [Tutte-Berge, Edmonds-Galai] Blossom algorithm: O(n 4 ). [Edmonds 965] Best known: O(m n /2 ). [Micali-Vazirani 980, Vazirani 994] 6

17 k-regular bipartite graphs Dancing problem. Exclusive Ivy league party attended by n men and n women. Each man knows exactly k women; each woman knows exactly k men. Acquaintances are mutual. Is it possible to arrange a dance so that each woman dances with a different man that she knows? Mathematical reformulation. Does every k-regular bipartite graph have a perfect matching? 2-regular bipartite graph ' 2 2' 3 3' 4 women 4' men 7

18 k-regular bipartite graphs have perfect matchings Theorem. Every k-regular bipartite graph G has a perfect matching. Pf. Size of max matching = value of max flow in G'. Consider flow f is a flow in G' and its value = n perfect matching. /k /k ' G' s 2 2' t 3 3' 4 4' a feasible flow f of value n 8

19 7. NETWORK FLOW II bipartite matching disjoint paths extensions to max flow 3D Memory Reliability survey design airline scheduling image segmentation project selection baseball elimination

20 Edge-disjoint paths Def. Two paths are edge-disjoint if they have no edge in common. Disjoint path problem. Given a digraph G = (V, E) and two nodes s and t, find the max number of edge-disjoint s t paths. 2 5 s 3 6 t digraph G

21 Edge-disjoint paths Def. Two paths are edge-disjoint if they have no edge in common. Disjoint path problem. Given a digraph G = (V, E) and two nodes s and t, find the max number of edge-disjoint s t paths. Ex. Communication networks. 2 5 s 3 6 t digraph G 2 edge-disjoint paths 4 7 2

22 Edge-disjoint paths Max flow formulation. Assign unit capacity to every edge. Theorem. Max number edge-disjoint s t paths equals value of max flow. Pf. Suppose there are k edge-disjoint s t paths P,, P k. Set f (e) = if e participates in some path P j ; else set f (e) = 0. Since paths are edge-disjoint, f is a flow of value k. s t 22

23 Edge-disjoint paths Max flow formulation. Assign unit capacity to every edge. Theorem. Max number edge-disjoint s t paths equals value of max flow. Pf. Suppose max flow value is k. Integrality theorem there exists 0- flow f of value k. Consider edge (s, u) with f(s, u) =. by conservation, there exists an edge (u, v) with f(u, v) = continue until reach t, always choosing a new edge Produces k (not necessarily simple) edge-disjoint paths. can eliminate cycles s t to get simple paths in O(mn) time if desired (flow decomposition) 23

24 Network connectivity Def. A set of edges F E disconnects t from s if every s t path uses at least one edge in F. Network connectivity. Given a digraph G = (V, E) and two nodes s and t, find min number of edges whose removal disconnects t from s. 2 5 s 3 6 t

25 Menger's theorem Theorem. [Menger 927] The max number of edge-disjoint s t paths is equal to the min number of edges whose removal disconnects t from s. Pf. Suppose the removal of F E disconnects t from s, and F = k. Every s t path uses at least one edge in F. Hence, the number of edge-disjoint paths is k s 3 6 t s 3 6 t

26 Menger's theorem Theorem. [Menger 927] The max number of edge-disjoint s t paths equals the min number of edges whose removal disconnects t from s. Pf. Suppose max number of edge-disjoint paths is k. Then value of max flow = k. Max-flow min-cut theorem there exists a cut (A, B) of capacity k. Let F be set of edges going from A to B. F = k and disconnects t from s. A s 3 6 t s 3 6 t

27 Edge-disjoint paths in undirected graphs Def. Two paths are edge-disjoint if they have no edge in common. Disjoint path problem in undirected graphs. Given a graph G = (V, E) and two nodes s and t, find the max number of edge-disjoint s-t paths. 2 5 s 3 6 t digraph G

28 Edge-disjoint paths in undirected graphs Def. Two paths are edge-disjoint if they have no edge in common. Disjoint path problem in undirected graphs. Given a graph G = (V, E) and two nodes s and t, find the max number of edge-disjoint s-t paths. 2 5 s 3 6 t digraph G (2 edge-disjoint paths)

29 Edge-disjoint paths in undirected graphs Def. Two paths are edge-disjoint if they have no edge in common. Disjoint path problem in undirected graphs. Given a graph G = (V, E) and two nodes s and t, find the max number of edge-disjoint s-t paths. 2 5 s 3 6 t digraph G (3 edge-disjoint paths)

30 Edge-disjoint paths in undirected graphs Max flow formulation. Replace edge edge with two antiparallel edges and assign unit capacity to every edge. Observation. Two paths P and P2 may be edge-disjoint in the digraph but not edgedisjoint in the undirected graph. if P uses edge (u, v) and P2 uses its antiparallel edge (v, u) s t 30

31 Edge-disjoint paths in undirected graphs Max flow formulation. Replace edge edge with two antiparallel edges and assign unit capacity to every edge. Lemma. In any flow network, there exists a maximum flow f in which for each pair of antiparallel edges e and e', either f (e) = 0 or f (e') = 0 or both. Moreover, integrality theorem still holds. Pf. [ by induction on number of such pairs of antiparallel edges ] Suppose f (e) > 0 and f (e') > 0 for a pair of antiparallel edges e and e'. Set f (e) = f (e) δ and f (e') = f (e') δ, where δ = min { f (e), f (e') }. f is still a flow of the same value but has one fewer such pair. Flow has direction s t 3

32 Edge-disjoint paths in undirected graphs Max flow formulation. Replace edge edge with two antiparallel edges and assign unit capacity to every edge. Lemma. In any flow network, there exists a maximum flow f in which for each pair of antiparallel edges e and e', either f (e) = 0 or f (e') = 0 or both. Moreover, integrality theorem still holds. Theorem. Max number edge-disjoint s t paths equals value of max flow. Pf. Similar to proof in digraphs; use lemma. s t 32

33 Menger's theorems Theorem. Given an undirected graph with two nodes s and t, the max number of edge-disjoint s-t paths equals the min number of edges whose removal disconnects s and t. Theorem. Given a undirected graph with two nonadjacent nodes s and t, the max number of internally node-disjoint s-t paths equals the min number of internal nodes whose removal disconnects s and t. Theorem. Given an directed graph with two nonadjacent nodes s and t, the max number of internally node-disjoint s t paths equals the min number of internal nodes whose removal disconnects t from s. 33

34 7. NETWORK FLOW II bipartite matching disjoint paths extensions to max flow 3D Memory Reliability survey design airline scheduling image segmentation project selection baseball elimination

35 Circulation with demands Def. Given a digraph G = (V, E) with nonnegative edge capacities c(e) and node supply and demands d(v), a circulation is a function that satisfies: For each e E: 0 f (e) c(e) (capacity) For each v V: (conservation) (supply node) network G -8-6 flow capacity 6 / 7 / 7 4 / 0 6 / 6 2 / 4 7 / / 3 4 / (demand node) (transshipment node) 35

36 Circulation with demands: max-flow formulation Add new source s and sink t. For each v with d(v) < 0, add edge (s, v) with capacity -d(v). For each v with d(v) > 0, add edge (v, t) with capacity d(v). Claim. G has circulation iff G' has max flow of value D = network G' -8 s -6 supply saturates all edges leaving s and entering t t demand 36

37 Circulation with demands Integrality theorem. If all capacities and demands are integers, and there exists a circulation, then there exists one that is integer-valued. Pf. Follows from max-flow formulation + integrality theorem for max flow. Theorem. Given (V, E, c, d), there does not exist a circulation iff there exists a node partition (A, B) such that Σ v B d(v) > cap(a, B). Pf sketch. Look at min cut in G'. demand by nodes in B exceeds supply of nodes in B plus max capacity of edges going from A to B 37

38 Circulation with demands and lower bounds Feasible circulation. Directed graph G = (V, E). Edge capacities c(e) and lower bounds l(e) for each edge e E. Node supply and demands d(v) for each node v V. Def. A circulation is a function that satisfies: For each e E : l(e) f (e) c(e) (capacity) For each v V : (conservation) Circulation problem with lower bounds. Given (V, E, l, c, d), does there exist a feasible circulation? 38

39 Circulation with demands and lower bounds Max flow formulation. Model lower bounds as circulation with demands. Send l(e) units of flow along edge e. Update demands of both endpoints. lower bound upper bound capacity v [2, 9] w v 7 w d(v) network G d(w) d(v) + 2 d(w) 2 network G' Theorem. There exists a circulation in G iff there exists a circulation in G'. Moreover, if all demands, capacities, and lower bounds in G are integers, then there is a circulation in G that is integer-valued. Pf sketch. f (e) is a circulation in G iff f '(e) = f (e) l(e) is a circulation in G'. 39

40 7. NETWORK FLOW II bipartite matching disjoint paths extensions to max flow 3D Memory Reliability survey design airline scheduling image segmentation project selection baseball elimination

41 3D memory Huge improvement on: bandwidth, capacity and footprint TSV provides high BW and low latency Low BW with slow growth Can be higher than 0TB/sec High latency High Power: 024 DDR3 ~ 40W NVIDIA ROADMAP Need for DL training

42 To Guarantee Yield for 3D-Stacked Memory Memory Test: Fault Bitmap Redundancy Analysis DRAM Array TSV as Bus Stack Self-Reparable Dies Peripheral Layer Memory Controller More self-reparable dies! High redundancy cost

43 replace those faulty bits How to repair memory and why Redundancy Sharing? Given a fault map and fixed number of redundant row/columns, find an assignment to Row ID can be improved 7 by redundancy 6 sharing! 2 Solution 4 5 Col ID R, 2C, Irreparable 0R, 3C, Reparable 2R, C, Reparable With the same amount of resources, memory yield R, 2C, Self-Reparable This original idea is referred by > 00 and adopted by AMD... Replacing row/col with redundant row/col = find vertices cover all edges

44 Matching is Critical for the Final Yield An extreme example A 2 Self-reparable matching: Yield = 25% B Conservative matching: Yield = 50% C Aggressive matching: Yield = 0% D Effective matching: Yield = 75% Faulty map is darker if the bit array has more faulty bits

45 How to Conduct Die Matching? Construct an undirected graph with each die as an vertex Add edges if two dies are reparable with redundancy sharing Conduct maximum matching algorithm Hundreds of Thousands of dies!

46 How to Conduct Die Matching? How do we know whether two dies are reparable after bonding? Run Greedy based heuristic between every pair, but not optimal Run final repair algorithm between every pair (Exhaustive search) Best yield, but time-consuming (Quadratic time complexity) We need to estimate whether two dies matched together can form a reparable stack efficiently

47 Die Matching Based on Sufficient Condition Reparability guaranteed Based on fast greedy heuristic Matched Dies Self-reparable Dies Optimal Matched Dies Matching a.t. sufficient condition is rather conservative

48 Die Matching Based on Necessary Condition Irreparable pairs exclusion Min. vertex cover == max. matching Matched Dies Self-reparable Dies <= # spare rows/cols A necessary condition Exclude: non-reparable matching Reparable Dies among matched dies Included matching is not guaranteed Optimal Matched Dies Matching a.t. irreparability condition is rather aggressive

49 Iterative Die Matching Irreparable pairs exclusion Min. vertex cover == max. matching + T Tighten the condition by increase T in each iteration Rest of Dies Matched Dies Reparable Dies a.t. Irreparability Condition No more reparable dies found

50 Experimental Results Poisson Distribution Self-reparable Reparability Matched Irreparability Irreparability Iterative 0 6*6 0*0 4*4 8*8

51 Router Based TSV Redundancy [DATE 2] TSV Grid and Signal Routing Infrastructure Successively Signal Rerouting Repair Switch faulty TSV with nearest good TSV, and Signal continue until a redundant TSV is used Router Design TSV North West East Signal TSV Redundant TSV South Signal Lend TSV to North, Lend Initial TSV to North bypass signal from west

52 - Bounded search tree based heuristic Rerouting Scheme TSV N Repair Channel Repair Path W E S Sig Small TSV Grid : Edge Disjoint Paths Problem Large TSV Grid : Length-bounded flow problem - Maximum flow based algorithm

53 Catastrophic Defects [TCAD 3] Mathematical model for reparability on clustering TSV defects Topology Mapping

54 7. NETWORK FLOW II bipartite matching disjoint paths extensions to max flow 3D Memory Reliability survey design airline scheduling image segmentation project selection baseball elimination

55 Survey design Design survey asking n consumers about n 2 products. Can only survey consumer i about product j if they own it. Ask consumer i between c i and c i ' questions. Ask between p j and pj' consumers about product j. Goal. Design a survey that meets these specs, if possible. one survey question per product Bipartite perfect matching. Special case when c i = c i ' = pj = pj' =. 55

56 Survey design Max-flow formulation. Model as circulation problem with lower bounds. Add edge (i, j) if consumer j owns product i. Add edge from s to consumer j. Add edge from product i to t. Add edge from t to s. Integer circulation feasible survey design. [0, ] [0, ] ' [c, c'] 2 2' [p, p'] s 3 3' t 4 4' consumers products 56

57 7. NETWORK FLOW II bipartite matching disjoint paths extensions to max flow 3D Memory Reliability survey design airline scheduling image segmentation project selection baseball elimination

58 Airline scheduling Airline scheduling. Complex computational problem faced by nation's airline carriers. Produces schedules that are efficient in terms of: equipment usage, crew allocation, customer satisfaction in presence of unpredictable issues like weather, breakdowns One of largest consumers of high-powered algorithmic techniques. "Toy problem." Manage flight crews by reusing them over multiple flights. Input: set of k flights for a given day. Flight i leaves origin o i at time s i and arrives at destination d i f i. Minimize number of flight crews. destination at time 58

59 Airline scheduling Circulation formulation. [to see if c crews suffice] For each flight i, include two nodes u i and vi. Add source s with demand -c, and edges (s, u i) with capacity. Add sink t with demand c, and edges (v i, t) with capacity. For each i, add edge (u i, vi) with lower bound and capacity. if flight j reachable from i, add edge (v i, uj) with capacity. crew can end day crew can begin day with any flight u v with any flight [0, ] [0, ] c -c s u 3 v 3 t use c crews u 2 [, ] v 2 [0, ] u 4 v 4 flight 2 is performed same crew can do flights 2 and 4 59

60 Airline scheduling: running time Theorem. The airline scheduling problem can be solved in O(k 3 log k) time. Pf. k = number of flights. c = number of crews (unknown). O(k) nodes, O(k2 ) edges. At most k crews needed. solve lg k circulation problems. Value of the flow is between 0 and k. at most k augmentations per circulation problem. Overall time = O(k3 log k). binary search for optimal value c* Remark. Can solve in O(k 3 ) time by formulating as minimum flow problem. 60

61 Airline scheduling: postmortem Remark. We solved a toy problem. Real-world problem models countless other factors: Union regulations: e.g., flight crews can only fly certain number of hours in given interval. Need optimal schedule over planning horizon, not just one day. Deadheading has a cost. Flights don't always leave or arrive on schedule. Simultaneously optimize both flight schedule and fare structure. Message. Our solution is a generally useful technique for efficient reuse of limited resources but trivializes real airline scheduling problem. Flow techniques useful for solving airline scheduling problems (and are widely used in practice). Running an airline efficiently is a very difficult problem. 6

62 7. NETWORK FLOW II bipartite matching disjoint paths extensions to max flow 3D Memory Reliability survey design airline scheduling image segmentation project selection baseball elimination

63 Image segmentation Image segmentation. Central problem in image processing. Divide image into coherent regions. Ex. Three people standing in front of complex background scene. Identify each person as a coherent object. liver and hepatic vascularization segmentation 63

64 Image segmentation Foreground / background segmentation. Label each pixel in picture as belonging to foreground or background. V = set of pixels, E = pairs of neighboring pixels. a i 0 is likelihood pixel i in foreground. b i 0 is likelihood pixel i in background. p ij 0 is separation penalty for labeling one of i and j as foreground, and the other as background. Goals. Accuracy: if a i > b i in isolation, prefer to label i in foreground. Smoothness: if many neighbors of i are labeled foreground, we should be inclined to label i as foreground. Find partition (A, B) that maximizes: foreground background 64

65 Image segmentation Formulate as min cut problem. Maximization. No source or sink. Undirected graph. Turn into minimization problem. Maximizing is equivalent to minimizing or alternatively 65

66 Image segmentation Formulate as min cut problem G' = (V', E'). Include node for each pixel. Use two antiparallel edges instead of undirected edge. Add source s to correspond to foreground. Add sink t to correspond to background. edge in G pij two antiparallel edges in G' pij pij aj s i pij j t bi G' 66

67 Image segmentation Consider min cut (A, B) in G'. A = foreground. if i and j on different sides, pij counted exactly once Precisely the quantity we want to minimize. aj s i pij j t A bi G' 67

68 7. NETWORK FLOW II bipartite matching disjoint paths extensions to max flow survey design airline scheduling image segmentation project selection baseball elimination

69 Project selection (maximum weight closure problem) Projects with prerequisites. Set of possible projects P : project v has associated revenue pv. Set of prerequisites E : if (v, w) E, cannot do project v unless also do project w. can be positive or negative A subset of projects A P is feasible if the prerequisite of every project in A also belongs to A. Project selection problem. Given a set of projects P and prerequisites E, choose a feasible subset of projects to maximize revenue. 69

70 Project selection: prerequisite graph Prerequisite graph. Add edge (v, w) if can't do v without also doing w. w w v x v x { v, w, x } is feasible { v, x } is infeasible 70

71 Project selection: min-cut formulation Min-cut formulation. Assign capacity to all prerequisite edge. Add edge (s, v) with capacity- p v if p v > 0. Add edge (v, t) with capacity -p v if p v < 0. For notational convenience, define p s = p t = 0. p u u w -p w s p y y z -p z t p v -p x v x 7

72 Project selection: min-cut formulation Claim. (A, B) is min cut iff A { s } is optimal set of projects. Infinite capacity edges ensure A { s } is feasible. Max revenue because: Sum of Pv(v in A: Pv >0) - Sum of Pv(v in A: Pv >0) w u p u -p w s p y y z -p z t A p v -p x v x 72

73 Open-pit mining Open-pit mining. (studied since early 960s) Blocks of earth are extracted from surface to retrieve ore. Each block v has net value p v = value of ore processing cost. Can't remove block v before w or x. w v x 73

74 7. NETWORK FLOW II bipartite matching disjoint paths extensions to max flow survey design airline scheduling image segmentation project selection baseball elimination

75 Baseball elimination 75

76 Baseball elimination problem Q. Which teams have a chance of finishing the season with the most wins? i team wins losses to play ATL PHI NYM MON 0 Atlanta Philly New York Montreal Montreal is mathematically eliminated. Montreal finishes with 80 wins. Atlanta already has 83 wins. Remark. This is the only reason sports writers appear to be aware of conditions are sufficient but not necessary! 76

77 Baseball elimination problem Q. Which teams have a chance of finishing the season with the most wins? i team wins losses to play ATL PHI NYM MON 0 Atlanta Philly New York Montreal Philadelphia is mathematically eliminated. Philadelphia finishes with 83 wins. Either New York or Atlanta will finish with 84 wins. Observation. Answer depends not only on how many games already won and left to play, but on whom they're against. 77

78 Baseball elimination problem Current standings. Set of teams S. Distinguished team z S. Team x has won w x games already. Teams x and y play each other r xy additional times. Baseball elimination problem. Given the current standings, is there any outcome of the remaining games in which team z finishes with the most (or tied for the most) wins? 78

79 Baseball elimination problem: max-flow formulation Can team 4 finish with most wins? Assume team 4 wins all remaining games w 4 + r 4 wins. Divvy remaining games so that all teams have w 4 + r 4 wins. 0 games left between and team 2 can still win this many more games 0 3 s g2 2 2 w4 + r4 w2 t team nodes (each team other than 4) 3 game nodes (each pair of teams other than 4) 79

80 Baseball elimination problem: max-flow formulation Theorem. Team 4 not eliminated iff max flow saturates all edges leaving s. Pf. Integrality theorem each remaining game between x and y added to number of wins for team x or team y. Capacity on (x, t) edges ensure no team wins too many games. 0 games left between and team 2 can still win this many more games 0 3 s g2 2 2 w4 + r4 w2 t team nodes (each team other than 4) 3 game nodes (each pair of teams other than 4) 80

81 Baseball elimination: explanation for sports writers Q. Which teams have a chance of finishing the season with the most wins? i team wins losses to play NYY BAL BOS TOR DET 0 New York Baltimore Boston Toronto Detroit Detroit is mathematically eliminated. AL East (August 30, 996) Detroit finishes with 76 wins. Wins for R = { NYY, BAL, BOS, TOR } = 278. Remaining games among { NYY, BAL, BOS, TOR } = = 27. Average team in R wins 305/4 = games. 8

82 Baseball elimination: explanation for sports writers Certificate of elimination. Theorem. [Hoffman-Rivlin 967] Team z is eliminated iff there exists a subset T* such that Pf. Suppose there exists T* S such that. Then, the teams in T* win at least (w(t*) + g(t*)) / T* games on average. This exceeds the maximum number that team z can win. 82

83 Baseball elimination: explanation for sports writers Pf. Use max-flow formulation, and consider min cut (A, B). Let T* = team nodes on source side A of min cut. Observe that game node x-y A iff both x T* and y T*. infinite capacity edges ensure if x-y A, then both x A and y A if x A and y A but x-y A, then adding x-y to A decreases the capacity of the cut by gxy y s gxy x-y x wz + rz wx t 83

84 Baseball elimination: explanation for sports writers Pf. Use max-flow formulation, and consider min cut (A, B). Let T* = team nodes on source side A of min cut. Observe that game node x-y A iff both x T* and y T*. Since team z is eliminated, by max-flow min-cut theorem, Rearranging terms: capacity of game edges leaving s capacity of team edges entering t y s gxy x-y x wz + rz wx t 84