This preview shows page 1. Sign up to view the full content.
CSCI 323 FALL 09 HOMEWORK 8 OUT: NOV 16 (MON), DUE: NOV 23 (MON) Instructions: Submit your written solutions to questions 1, 2 and 3 at the beginning of class on Nov 23 (Mon), 5 pm. The Python ﬁle maxsums.py is due due on Nov 24 (Tue) at 11.59 pm (no late submissions accepted after that). 1. (Max-Flow Example) Textbook Chapter 7, Exercise 3. 2. (Scheduling Cooking Nights) Textbook Chapter 7, Exercise 15. Simply state what the vertices and edges are in the graph G . 3. (Hospital Assignment) Textbook Chapter 7, Exercise 9 We can solve this problem by solving the max-ﬂow problem on a ﬂow network G constructed as follows: There are two distinguished nodes s and t , along with n + k additional nodes: H 1 ,...,H k corresponding to the k hospitals and P 1 ,...,P n corresponding to the n injured people. (a) Specify the edges in the ﬂow network along with their capacities. (b) Suppose the maximum ﬂow on the network G has value v . What should the algorithm return? (i.e., How should the algorithm decide whether to return “possible” or “impossible”?)
This is the end of the preview. Sign up to access the rest of the document.
This note was uploaded on 05/31/2010 for the course COMPUTER S 700 taught by Professor Joewhite during the Spring '10 term at Universidad San Martín de Porres.
- Spring '10