One algorithmic technique that works here is called "bounded search tree algorithm", and its idea is to repeatedly choose some vertex and recursively branch, with two cases at each step: place either the current vertex or all its neighbours into the vertex cover.