Question: This problem is about approximation algorithm, thanks very much if you can help 2. Give a randomized rounding algorithm for the GENERAL COVER prob- lem


This problem is about approximation algorithm, thanks very much if you can help
2. Give a randomized rounding algorithm for the GENERAL COVER prob- lem (from the lecture notes) with an O(log m) approximation ratio where m is the number of elements in U. Show your algorithm and the approx- imation proof. 2. Give a randomized rounding algorithm for the GENERAL COVER prob- lem (from the lecture notes) with an O(log m) approximation ratio where m is the number of elements in U. Show your algorithm and the approx- imation proof
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
