A vertex cover of an undirected graphGis a subset of the vertices that contains at least one endpoint of every edge. An instance of theVertex Coverproblem consists of a graphGand integerk, and asks whetherGhas a vertex cover of size at mostk.Vertex Coveris one of the six classic NP-co...