Algorithms for NP-Hard Problems (Section 21.3: Problem-Specific Algorithms vs. Magic Boxes)
Tim Roughgarden Lectures · 8:23
This lecture (Algorithms Illuminated, Part 4, §21.3) argues that before inventing a bespoke algorithm you should ask whether your problem is a special case of something already solvable—and that “solvable” can mean ha...