Submodularity and the set cover problem
If a function on sets is submodular, approximation bounds can be proven for optimisation problems involving that function. One such case is the set cover problem. This post contains my notes on the problem and show how the approximation bound can be proven.