approximation-algorithm

1 free lesson tagged approximation-algorithm across AI. Each one is a short sequence of focused steps with narration and a five-question quiz at the end — take them in any order, no signup required.

advanced

The Greedy Algorithm and Its 63% Guarantee

Maximizing a submodular function is NP-hard, yet the simplest possible algorithm gets provably close to optimal. This lesson presents the greedy algorithm, the celebrated (1 - 1/e) guarantee of Nemhauser, Wolsey, and Fisher, why that bound cannot be beaten, and the lazy trick that makes greedy fast at scale.

8 steps·~12 min

The Greedy Algorithm and Its 63% Guarantee

Related topics