Connect with us


Computer Scientists Break the ‘Traveling Salesperson’ Record – WIRED

Finally, there’s a better way to find approximate solutions to the notorious optimization problem, often used to test the limits of efficient computation.



post featured image

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.
Original story reprinted with permission from Quanta Magazine, an editorially independent publication of the Simons Foundation whose mission is to enhance public understanding of science by covering research develop­ments and trends in mathe­matics and the physical and life sciences.
Even if they didnt…

Click here to view the original article.

You might also like ...

post featured image
AMD’s newest graphics cards: RDNA2 power from $579 to $999 – Ars Technica
post featured image
Billy Mitchell’s Donkey Kong high-score case will move forward to trial – Ars Technica
post featured image
Why Alphabet Stock Sank Today – Motley Fool