For example, there is a different approximation algorithm for Minimum Vertex Cover that solves a linear programming relaxation to find a vertex cover that is at most twice the value of the relaxation.