Media Summary: Link to this course on coursera( Special discount) ... Textbooks: Computational Complexity: A Modern Approach by S. Arora and B. Barak. In this video, we discuss the vertex cover problem. In particular we show that Vertex Cover can be 2-approximated.
Approximation Algorithms Learn Algorithms - Detailed Analysis & Overview
Link to this course on coursera( Special discount) ... Textbooks: Computational Complexity: A Modern Approach by S. Arora and B. Barak. In this video, we discuss the vertex cover problem. In particular we show that Vertex Cover can be 2-approximated. This is a short lecture on "The P versus NP problem" by Prof. Naveen Garg of Computer Science department at the IIT-Delhi.
