This preview has intentionally blurred sections. Sign up to view the full version.
View Full Document
Unformatted text preview: CSE450/598 Design And Analysis of Algorithms HW05, Wednesday, 04/09/2008, Due: Monday, 04/21/2008 Please note that you have to typeset your assignment using either L A T E X or Microsoft Word. Handwritten assignment will not be graded. Also, it is recommended that you save a copy of your assignment on general.asu.edu . All homework assignments are your own work. While you are encourage to discuss the materials studied in class, you are not supposed to discuss the solutions to homework problems. 1. (10 pts) Exercise 74. Solutions: This is false. Consider a graph with nodes s, v, w, t , edges ( s, v ) , ( v, w ) , ( w, t ), capacities of 2 on ( s, v ) and ( w, t ), and a capacity of 1 on ( v, w ). Then the maximum flow has value 1, and does not saturate the edge out of s . Grading: 5 pts for the answer; 5 pts for the explanation. 2. (10 pts) Exercise 79. Solutions: We construct the following flow network. There is a node v i for each patient i , and a node w j for each hospital j . There is an edge ( v i , w j ) of capacity 1 if and only if patient i is within half an hour from hostipal j . We add a supersource node s and a supersink node t . For each v i , add a unit capacity edge from s to v i . For each w j , add an from w j to t with capacity d...
View
Full Document
 Spring '08
 GuoliangXue
 Algorithms, Graph Theory, pts, Flow network

Click to edit the document details