Skip to content

Algorithms for NP-Hard Problems (Section 20.3: A Greedy Heuristic for Influence Maximization) [1/2]

Video by Tim Roughgarden Lectures, played through YouTube's embedded player.