Implementations of Dijkstra's algorithm based on multi-level buckets

MaRDI QIDQ4363173zbMATH OpenFDO

Authors Andrew V. Goldberg, Craig Silverstein

Publication date 12 October 1998

zbMATH Keywords

2-level bucketDijkstra's algorithmshortest paths problem

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Abstract computational complexity for mathematical programming problems (90C60)

Recommendations

• scientific article; zbMATH DE number 2081016
• Buckets, Heaps, Lists, and Monotone Priority Queues
• Two-level heaps: a new priority queue structure with applications to the single source shortest path problem
• Two-Level Heaps: A New Priority Queue Structure with Applications to the Single Source Shortest Path Problem
• Faster algorithms for the shortest path problem

Cited in

(4)

• A new algorithm for reoptimizing shortest paths when the arc costs change
• Shortest paths in a network with time-dependent flow speeds
• Shortest path reoptimization vs resolution from scratch: a computational comparison
• Exploring monotone priority queues for Dijkstra optimization

This page was built for publication: Implementations of Dijkstra's algorithm based on multi-level buckets

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4363173)