Algorithm Design and Analysis December 5, 2007
Pennsylvania State University CSE 565
Professor Sofya Raskhodnikova
Homework 12 – Due Wednesday, December 12, 2007
Please refer to the general information handout for the full homework policy and options.
Reminders
•Your solutions are due before the lecture. Late homework will not be accepted.
•Collaboration is permitted, but you must write the solutions by yourself without assistance, and
be ready to explain them orally to a member of the course staff if asked. You must also identify
your collaborators. Getting solutions from outside sources such as the Web or students not
enrolled in the class is strictly forbidden.
•To facilitate grading, please write down your solution to each problem on a separate sheet of
paper. Make sure to include all identifying information and your collaborators on each sheet.
Your solutions to different problems will be graded separately, possibly by different people, and
returned to you independently of each other.
•For all problems where you are asked to design an algorithm, do not forget to prove correctness
and analyze your algorithms time and space complexity.
Exercises These should not be handed in, but the material they cover may appear on exams:
1. Chapter 11, problem 1.
2. Chapter 13, problems 1,2.
Problems to be handed in
1. (Feasible Subset with Largest Sum) Chapter 11, problem 3.
2. (Weighted Hitting Set) Chapter 11, problem 4.
3. (Distributed Independent Set) Chapter 13, problem 3.
1