Surpassing Dijkstra
-
The paper:
https://arxiv.org/html/2504.17033v2
Abstract:
Team in China came up with faster algorithm to find single-source shortest path. Before this, the fastest algorithm was developed by Dijkstra and published in 1984. Dijkstra’s name are in many Mathematics and Computer Science text books for this reason. I would venture to guess that anyone who has a Computer Science or Computer Engineering degree today knows Dijkstra’s name (though few will remember the algorithm itself). So surpassing Dijkstra’s algorithm after 41 years is a big deal.
-
Judging from the abstract, the algorithm would actually be slower than Dijkstra's if the graph is not sparse.
But still a cool result. Also, it was published at a reputable venue and survived peer review, it's not just a random arxiv paper.
