Unformatted text preview: factor 1/4. If you believe that your analysis is tight, give a tight example. Note: If your answer in part (a) was a greedy deterministic algorithm, then you only need to anwer if and why your analysis is tight. Problem 2 Use the method of conditional expectations to derandomize the 1-1 /e factor algorithm for MAX-SAT in paragraph 16.3, pages 133-135, of Vazirani’s book....
View Full Document
- Spring '08
- Algorithms, polynomial time algorithm, approximation algorithms, approximation guarantee factor, greedy deterministic algorithm