Tonight Alvin talked about Approximation Algorithms, specifically for the Metric Traveling Salesman Problem (metric TSP).
We’ll get to cover the best-known (I am lying just a little bit) approximation algorithm for this problem.
Previous: NP and quantum computing
Suhas talked bout NP and connections to quantum computing.
continue reading ❯