This preview has intentionally blurred sections. Sign up to view the full version.View Full Document
Unformatted text preview: Introduction to Algorithms Problem Set 8 CS 482 Spring 2006 Due: Friday, April 7 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.5 - 8.8, 8.10. Question 1 You and your band (Five Angry Puppies) have decided that this summer, you’re going to drive out to California to hang out by the beach, record some songs, and maybe even get picked up by a big label. Along the way, you’d like to stop and play at as many small-town coffee shops and similar venues as possible, to hopefully get some hype building for your new album (Give Us Pizza). However, you realize that it would be kind of pointless if you spend the bulk of the summer just getting out there. So you and the band agree that the trip shouldn’t be longer than M miles. On the trip, you’d like to be able to perform in at least k venues. You’ve got a map to measure the lengths of various routes and highways, and you also have found out number of available venues along each route.various routes and highways, and you also have found out number of available venues along each route....
View Full 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.
- Spring '06