Question: Give a constant factor approximation algorithm (that runs in polynomial time), and prove its correctness. (Your algorithm should always output a set of questions such

 Give a constant factor approximation algorithm (that runs in polynomial time),

Give a constant factor approximation algorithm (that runs in polynomial time), and prove its correctness. (Your algorithm should always output a set of questions such that for every student in the class, there exists a question they got a non-zero score in. The size of this set should be approximately optimal)

Step by Step Solution

There are 3 Steps involved in it

1 Expert Approved Answer
Step: 1 Unlock blur-text-image
Question Has Been Solved by an Expert!

Get step-by-step solutions from verified subject matter experts

Step: 2 Unlock
Step: 3 Unlock

Students Have Also Explored These Related Mathematics Questions!