Algorithms for NP-Hard Problems (Section 23.3: NP: Problems with Easily Recognized Solutions)
How can we define the set of “exhaustive-search-solvable” problems—the set of all problems that might plausibly reduce to the TSP? The big idea is the efficient recognition of purported solutions.
Accompanies the book Algorithms Illuminated, Part 4: Algorithms for NP-Hard Problems. (http://www.algorithmsilluminated.org/)
Full playlist: • Algorithms Illuminated, Part 4: Algorithms...