Tsinghua researchers break 41-year record, prove Dijkstra is not optimal
jedisct1 · x · 2026-09-01
A Tsinghua University team published a paper breaking the "sorting barrier" held since 1984: textbooks taught that shortest-path search requires sorting nodes by distance, which has a mathematical floor. By combining Bellman-Ford logic with a novel "recursive partial ordering" method, they solve the problem without fully sorting nodes, proving Dijkstra—used everywhere from Google Maps to internet routing—is not optimal.
More from Research
- Evolution Strategies Boost LLM Reasoning Coverage — yeewhye · 2026-09-01
- New Paper: Learning Agile Perceptive Traversal of Sparse 3D Structures for Humanoids — ChongZzZhang · 2026-09-01
- Talk: Eliciting Any-Order Inference from Any-Order Models — NandoDF · 2026-09-01
- Why Diffusion is Slow and How Flow Matching Speeds It Up — NandoDF · 2026-09-01
- LLM Engineering Lacks Discipline: Moving from Intuition to Rigor — camerongreen95 · 2026-09-01
- Gobanorobotics releases Toutatis v1: trains 99%+ reliable robot controllers from few demos — lukas_m_ziegler · 2026-09-01