Algorithms for NP-Hard Problems (Section 20.3: A Greedy Heuristic for Influence Maximization) [1/2]
Tim Roughgarden Lectures · 19:08
This lecture (Algorithms Illuminated Part 4, §20.3) introduces the influence maximization problem: pick at most \(k\) seed vertices in a directed social graph so a simple cascade process activates as many people as po...