Vertex cover Problem
Complexity ©D Moshkovitz 1 Approximation Algorithms Is Close Enough Good Enough?
The Importance of Being Biased Irit Dinur S. Safra (some slides borrowed from Dana Moshkovitz) Irit Dinur S. Safra (some slides borrowed from Dana Moshkovitz)
1 Approximation Algorithms. 2 Motivation By now we’ve seen many NP-Complete problems. We conjecture none of them has polynomial time algorithm.
1 Approximation Algorithm Instructor: yedeshi [email protected].
Approximation Algorithm
