# Approximation factor for greedy vertex cover algorithm

The algorithm iteratively picks the vertex with maximum degree and removes it and every incident edge of the vertex, until only vertices with degree of $$0$$ are left.