{"id":150129,"date":"2022-11-14T21:23:39","date_gmt":"2022-11-15T03:23:39","guid":{"rendered":"https:\/\/lifeboat.com\/blog\/2022\/11\/computer-scientists-succeed-in-solving-algorithmic-riddle-from-the-1950s"},"modified":"2022-11-14T21:23:39","modified_gmt":"2022-11-15T03:23:39","slug":"computer-scientists-succeed-in-solving-algorithmic-riddle-from-the-1950s","status":"publish","type":"post","link":"https:\/\/lifeboat.com\/blog\/2022\/11\/computer-scientists-succeed-in-solving-algorithmic-riddle-from-the-1950s","title":{"rendered":"Computer scientists succeed in solving algorithmic riddle from the 1950s"},"content":{"rendered":"<p><a class=\"aligncenter blog-photo\" href=\"https:\/\/lifeboat.com\/blog.images\/computer-scientists-succeed-in-solving-algorithmic-riddle-from-the-1950s2.jpg\"><\/a><\/p>\n<p>For more than half a century, researchers around the world have been struggling with an algorithmic problem known as \u201c<i>the single source shortest path<\/i> problem.\u201d The problem is essentially about how to devise a mathematical recipe that best finds the shortest route between a node and all other nodes in a network, where there may be connections with negative weights.<\/p>\n<p>Sound complicated? Possibly. But in fact, this type of calculation is already used in a wide range of the apps and technologies that we depend upon for finding our ways around\u2014as Google Maps guides us across landscapes and through cities, for example.<\/p>\n<p>Now, researchers from the University of Copenhagen\u2019s Department of Computer Science have succeeded in solving the single source shortest <a href=\"https:\/\/techxplore.com\/tags\/path\/\" rel=\"tag\" class=\"\">path<\/a> problem, a riddle that has stumped researchers and experts for decades.<\/p>\n","protected":false},"excerpt":{"rendered":"<p>For more than half a century, researchers around the world have been struggling with an algorithmic problem known as \u201cthe single source shortest path problem.\u201d The problem is essentially about how to devise a mathematical recipe that best finds the shortest route between a node and all other nodes in a network, where there may [\u2026]<\/p>\n","protected":false},"author":359,"featured_media":0,"comment_status":"open","ping_status":"closed","sticky":false,"template":"","format":"standard","meta":{"footnotes":""},"categories":[1523,41,1965,2229],"tags":[],"class_list":["post-150129","post","type-post","status-publish","format-standard","hentry","category-computing","category-information-science","category-mapping","category-mathematics"],"_links":{"self":[{"href":"https:\/\/lifeboat.com\/blog\/wp-json\/wp\/v2\/posts\/150129","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/lifeboat.com\/blog\/wp-json\/wp\/v2\/posts"}],"about":[{"href":"https:\/\/lifeboat.com\/blog\/wp-json\/wp\/v2\/types\/post"}],"author":[{"embeddable":true,"href":"https:\/\/lifeboat.com\/blog\/wp-json\/wp\/v2\/users\/359"}],"replies":[{"embeddable":true,"href":"https:\/\/lifeboat.com\/blog\/wp-json\/wp\/v2\/comments?post=150129"}],"version-history":[{"count":0,"href":"https:\/\/lifeboat.com\/blog\/wp-json\/wp\/v2\/posts\/150129\/revisions"}],"wp:attachment":[{"href":"https:\/\/lifeboat.com\/blog\/wp-json\/wp\/v2\/media?parent=150129"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/lifeboat.com\/blog\/wp-json\/wp\/v2\/categories?post=150129"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/lifeboat.com\/blog\/wp-json\/wp\/v2\/tags?post=150129"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}