Computer Scientists Break Traveling Salesperson Record
After 44 years, there’s finally a better way to find approximate solutions to the notoriously difficult traveling salesperson problem.
2
Enjoy being online again!
Welcome to the community of good people who base their values on evidence and appreciate civil discourse - the social network you will enjoy.Create your free account
1 comment
Feel free to reply to any comment by clicking the "Reply" button.Well it's better, but maybe not as much as you hoped...
Now Karlin, Klein and Oveis Gharan have proved that an algorithm devised a decade ago beats Christofides’ 50% factor, though they were only able to subtract 0.2 billionth of a trillionth of a trillionth of a percent. Yet this minuscule improvement breaks through both a theoretical logjam and a psychological one. Researchers hope that it will open the floodgates to further improvements.
prometheus
Level 7
Oct 9, 2020
2
. . . I read it, no need to "shoot the messenger" 
Perhaps tis new method will help some other researcher find another, better solution.
Enjoy being online again!
Welcome to the community of good people who base their values on evidence and appreciate civil discourse - the social network you will enjoy.Create your free account
Share this post
Categories
Agnostic does not evaluate or guarantee the accuracy of any content. Read full disclaimer.