shortest-path

#shortest-path

@techNmak: For 38 years, computer scientists believed Dijkstra's algorithm was optimal for sparse graphs. The logic seemed airtigh…

X AI KOLs Timeline ↗ · 21h ago Cached

Five researchers from Tsinghua, Stanford, and Max Planck have developed a new shortest path algorithm that beats Dijkstra's for sparse directed graphs, achieving O(m log^(2/3) n) time complexity, the first improvement since 1987.

0 favorites 0 likes

#shortest-path

@lxfater: Researchers from Tsinghua University have surpassed the algorithm Google Maps has used for 41 years. From 1984 to the present, no one had managed to do so in 41 years. That algorithm is called Dijkstra. It doesn't matter if you haven't heard of it; you use it every day. However, it has been stuck for 40 years without breakthrough because of a mathematical sorting barrier standing in the way...

X AI KOLs Timeline ↗ · 2026-05-10

Researchers from Tsinghua University have developed a new shortest-path algorithm with O(m log^{2/3} n) complexity, surpassing Dijkstra's algorithm, which had been considered theoretically optimal for 41 years.

0 favorites 0 likes

shortest-path

@techNmak: For 38 years, computer scientists believed Dijkstra's algorithm was optimal for sparse graphs. The logic seemed airtigh…

Submit Feedback