arxiv
PublishedMay 16, 2026 at 4:00 AM
—neutral
Adapting Dijkstra for Buffers and Unlimited Transfers
Publisher summary· verbatim
arXiv:2603.11729v3 Announce Type: replace-cross Abstract: In recent years, RAPTOR based algorithms have been considered the state-of-the-art for path-finding with unlimited transfers without preprocessing. However, this status largely stems from the evolution of routing research, where Dijkstra-base
Stay posted· Newsletter
A 5-min weekly brief — top movers, price watch, story of the week.
Discussion
No replies yet. Be first.
Related coverage
More from ARXIV
arxivBringing Value Models Back: Generative Critics for Value Modeling in LLM Reinforcement Learning9harxivSubagents vs Agent Skills: Executing Reusable Knowledge for Long-Horizon Agentic Tasks9harxivDistribution-Consistent Inference for Dynamic Sparse Mixture-of-Experts9harxivIn RAG We Trust? Measuring Robustness of Retrieval-Augmented Generation Under Document Poisoning9hThe Bubble Brief
WEEKLYRead routing insights every Tuesday — top movers, new releases, story of the week.
Originally published on arxiv ↗