This preview has intentionally blurred sections. Sign up to view the full version.View Full Document
Unformatted text preview: Introduction to Algorithms Problem Set 10 CS 482 Spring 2006 Due: Friday, April 28 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 13.1 - 13.5. Question 1 Suppose, totally hypothetically, that you’ve been captured by pirates. They are about to make you walk the plank, when, on a hunch, one of the scurvy scalawags asks you whether you know anything about approximation algorithms. Uh-oh, you think. It turns out they have something of an optimization problem and need your help. They would like to get a pirate fleet going, but they are having trouble deciding how many ships they need, and who should go on each ship. See, being pirates and all, certain pairs are prone to quarrelling and never seem to get anything done when they are together. On the other hand, some pirates work really well together, and it would be a shame to break up such teams. The Captain gives you a list of those pairs of pirates who work well together, and a list of those who don’t. No pair appears on both lists, and some pairs might not appear on either. The problemwho don’t....
View Full Document
- Spring '06
- Algorithms, Computational complexity theory, Approximation algorithm, optimization problem, Pirates, poorly colored edges