jeremykun.com
When Greedy Algorithms are Good Enough: Submodularity and the (1 – 1/e)-Approximation
Greedy algorithms are among the simplest and most intuitive algorithms known to humans. Their name essentially gives their description: do the thing that looks best right now, and repeat until noth…