A variant of Vertex Cover

Our problem is a variant of the well-known \textsc{Vertex Cover} problem. In our problem, a vertex cover is already given, our task is to decide whether the given solution is optimal, i.e., minimum. This is to show that any purported heuristic algorithm needs something more novel.