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

When Ada Lovelace mused that the first mechanical computer “could compose elaborate pieces of music” if instructed properly, she planted the seed of a question that has since obsessed generations: ...

When Edsger W. Dijkstra published his algorithm in 1959, computer networks were barely a thing. The algorithm in question found the shortest path between any two nodes on a graph, with a variant ...

The original version of this story appeared in Quanta Magazine. If you want to solve a tricky problem, it often helps to get organized. You might, for example, break the problem into pieces and tackle ...

Chinese computer scientists have solved a 40-year-old mathematics bottleneck, an advance that might help boost performance in hi-tech areas ranging from chip design and telecommunications to drone ...

If you want to solve a tricky problem, it often helps to get organized. You might, for example, break the problem into pieces and tackle the easiest pieces first. But this kind of sorting has a cost.

Abstract: This paper investigates the shortest path planning of unmanned surface vehicles (USV) in complicated marine environments. A novel path planning method called “sunlight algorithm” is first ...

Dijkstra’s algorithm is great as long as we have no negative weight edges in our graph. But there are many problems for which it is natural to represent weights with positive and negative values—gains ...

ABSTRACT: In this paper we compare track data association purity, accuracy, and timing on a simple, idealized model tracking problem for two data association methods: Global Nearest Neighbor (GNN) and ...