A new quantum-inspired algorithm has cracked a problem so massive that conventional supercomputers struggle to even approach it. Researchers used the method to simulate extraordinarily complex quantum ...

Most of you have used a navigation app like Google Maps for your travels at some point. These apps rely on algorithms that compute shortest paths through vast networks. Now imagine scaling that task ...

The All-Pairs Shortest Paths Problem, Seeking the Shortest Distance Between Every Node Pair in a Graph, is Efficiently Solved by Johnson's Algorithm for All Pairs of a Vertext, Bellman-Ford for ...

Determining the least expensive path for a new subway line underneath a metropolis like New York City is a colossal planning challenge—involving thousands of potential routes through hundreds of city ...

Bio-inspired computational methods have gained popularity recently. These methods mimic the seemingly complex behavior of organisms to tackle difficult and often overwhelming problems. For example, ...

Ran Duan, Jiayi Mao, Xiao Mao, Xinkai Shu, Longhui Yin (2025): Breaking the Sorting Barrier for Directed Single-Source Shortest Paths“. 57th Annual ACM Symposium on Theory of Computing (STOC). Faster ...

Unmanned surface vehicles (USVs) nowadays have been widely used in ocean observation missions, helping researchers to monitor climate change, collect environmental data, and observe marine ecosystem ...

The original version of this story appeared in Quanta Magazine. For computer scientists, solving problems is a bit like mountaineering. First they must choose a problem to solve—akin to identifying a ...

Fuzzy optimization for shortest path problems addresses uncertainty in network weights by representing arc costs with fuzzy numbers rather than crisp values. By extending classical algorithms—such as ...

Dominik Bošnjak is a freelance writer from Croatia. He has been writing about games for as long as he can remember and began doing so professionally in 2010 because an opportunity presented itself ...

Abstract: The shortest path problem is a widely recognized and fundamental optimization problem in operations research. Nearly all practical implementations of the shortest path issue include ...