Algo Talk with SecondThread: Parade
Errichto Algorithms · 35:52
The puzzle is how to pick exactly K = 500 points out of N = 300,000 so that the shortest round trip through them (the travelling salesman problem, TSP) can actually be solved. The answer is to always pick a monotonic...