Abstract: Multi-objective multi-point shortest path planning problems are commonly encountered in real-world applications. Numerous path planning algorithms have been proposed to accommodate different ...

D-Wave is something of an anomaly in a quantum computing industry. While companies ranging from hyperscalers like Microsoft, ...

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 ...

Illustration: Dan Goldfarb / The Athletic; photos: Jared C. Tilton / Getty Images Brian Campbell isn’t offended by the question, but he knows it’s coming: What’s it like to compete as the shortest ...

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 ...

Shortest path algorithms sit at the heart of modern graph theory and many of the systems that move people, data, and goods around the world. After nearly seventy years of relying on the same classic ...

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 ...

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 ...