How to usehill climbing algorithm to find the minimum vertex cover for an undirected graph

Question
How to usehill climbing algorithm to find the minimum vertex cover for an undirected graph? Any idea about the algorithm and implementation in C language?

find the cost of your paper