Computer Scientists Break Traveling Salesperson Record (Quanta)
Erica Klarreich
Contributing Correspondent
October 8, 2020
When Nathan Klein started graduate school two years ago, his advisers proposed a modest plan: to work together on one of the most famous, long-standing problems in theoretical computer science.
Even if they didnt manage to solve it, they figured, Klein would learn a lot in the process. He went along with the idea. I didnt know to be intimidated, he said. I was just a first-year grad student I dont know whats going on.
Now, in a paper posted online in July, Klein and his advisers at the University of Washington, Anna Karlin and Shayan Oveis Gharan, have finally achieved a goal computer scientists have pursued for nearly half a century: a better way to find approximate solutions to the traveling salesperson problem.
This optimization problem, which seeks the shortest (or least expensive) round trip through a collection of cities, has applications ranging from DNA sequencing to ride-sharing logistics. Over the decades, it has inspired many of the most fundamental advances in computer science, helping to illuminate the power of techniques such as linear programming. But researchers have yet to fully explore its possibilities and not for want of trying.
***
more: https://www.quantamagazine.org/computer-scientists-break-traveling-salesperson-record-20201008/