Vertex Cover Problem

Problem Definition

Given a graph $G=(V,E)$, and an integer $k$, is there a subset of $k$ vertices such that each edge is incident to at least one vertex in the subset?