Algorithms for NP-Hard Problems (Section 19.4: Algorithmic Strategies for NP-Hard Problems)
Tim Roughgarden Lectures · 24:39
NP-hardness does not make a problem hopeless: assuming P ≠ NP, you cannot have an algorithm that is simultaneously general-purpose, always correct, and always polynomial-time, so you must drop one of those three prope...