At last! There’s an algorithm that’s closer than ever to solving the traveling salesperson problem
Computers are good at answering questions. Whats the shortest route from my house to Area 51? Is 8,675,309 a prime number? How many teaspoons in a tablespoon? For questions like these, theyve got you covered. My favorite hard problem is thetraveling salesperson problem. I work on approximation algorithms as acomputer scientist. It’s free, every week, in your inbox. This is important for more than just planning routes. You might say that these hard problems are all the same computational gremlin wearing different hats....