Understanding NP-Hard Problems and Exhaustive Search Solutions 🧩
Explore how NP-hard problems, including the Traveling Salesman Problem (TSP), can be approached with exhaustive search strategies and what defines problems that are solvable through such methods.
Tim Roughgarden Lectures
724 views • May 26, 2020
About this video
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: https://www.youtube.com/playlist?list=PLEGCF-WLh2RK6lq3iSsiU84rWVee3A-hz
Accompanies the book Algorithms Illuminated, Part 4: Algorithms for NP-Hard Problems. (http://www.algorithmsilluminated.org/)
Full playlist: https://www.youtube.com/playlist?list=PLEGCF-WLh2RK6lq3iSsiU84rWVee3A-hz
Video Information
Views
724
Likes
9
Duration
24:58
Published
May 26, 2020
Related Trending Topics
LIVE TRENDSRelated trending topics. Click any trend to explore more videos.
Trending Now