hw7 - Introduction to Algorithms CS 482 Spring 2006 Problem...

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

View Full Document Right Arrow Icon
Introduction to Algorithms Problem Set 7 CS 482 Spring 2006 Due: Friday, March 31 Please hand in each problem on separate sheets with your name and netID on each. If a problem requires multiple sheets, please staple the sheets for that problem together Reading: Chapters 8.1 - 8.5. Question 1 Suppose you and your k - 1 housemates decide to throw a party. Unfortunately, there seems to be little agreement on whom should be invited, and you don’t want to invite more people than can Ft in your house. Since you’re the only one in the house who can Fgure out how to get the DVD player to work, the task of resolving this problem has been left to you. In total, your house can hold n people (in addition to you and your housemates). Each housemate i gives you a list of people P i she would like to have invited to the party. Depending on how much you like housemate i , you pick an integer m i indicating the minimum number of people on i ’s list that you’ll invite. Having selected these values already, you’d like to know whether it is possible to invite at most
Background image of page 1

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

View Full DocumentRight Arrow Icon
Image of page 2
This is the end of the preview. Sign up to access the rest of the document.

This homework help was uploaded on 10/17/2007 for the course COM S 482 taught by Professor Wexler during the Spring '06 term at Cornell University (Engineering School).

Page1 / 2

hw7 - Introduction to Algorithms CS 482 Spring 2006 Problem...

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

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