Happy new year! Arvind gave a talk on randomized algorithms (planned topics: randomized sorting, Karger’s min cut algorithm).
A recording can be found here: https://tinyurl.com/4qnj67pb.
Previous: Traveling Salesman Problem
Neil gave a talk on the Traveling Salesman Problem (TSP), including the problem itself, NP-hardness (as well as briefly what it means to be in NP, NP-Hard, etc.), the DP algorithm for exact TSP, some variants, and approximation algorithms.
continue reading ❯