arxiv
PublishedMay 27, 2026 at 4:00 AM
Adapting Dijkstra for Buffers and Unlimited Transfers
Publisher summary· verbatim
arXiv:2603.11729v5 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
arxivADS-C: Antidistillation Sampling for Classification23harxivTesting Distributions Against Bounded Distinguishers23harxivFrom Black Box to Executable Logic: Explainable Reinforcement Learning through Prolog Expert Systems23harxivA Formally Grounded ODRL Evaluator: Implementation and Comparison23hThe Bubble Brief
WEEKLYRead AI insights every Tuesday — top movers, new releases, story of the week.
Originally published on arxiv ↗