The main question of this talk FOR EACH FIXED K,WHAT IS THE BEST ALGORITHM TO FIND A VERTEX COVER OF SIZE AT MOST K OR REPORT THERE IS NONE? The main question of this talk For each fixed k, what is the best algorithm to find a vertex cover of size at most k or report there is none?