Algorithms for NP-Hard Problems (Section 20.5: Principles of Local Search) [Part 1 of 2]
Tim Roughgarden Lectures · 23:11
Local search is an algorithm-design paradigm that explores feasible solutions by repeatedly taking an improving local move, which this lecture frames as a strictly improving walk through a metagraph whose vertices are...