A NOVEL LINEAR ALGORITHM FOR SHORTEST PATHS IN NETWORKS

DOI10.1142/S0217595912500546zbMath1267.90165OpenAlexW2023126570MaRDI QIDQ2836524

Dragan Vasiljević, Milos Danilovic

Publication date: 3 July 2013

Published in: Asia-Pacific Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1142/s0217595912500546

zbMATH Keywords

bucketspriority queuesheapssingle source problemweight ratio

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Queues and service in operations research (90B22)

Related Items (1)

A novel pseudo‐polynomial approach for shortest path problems

Cites Work

• Unnamed Item
• A note on two problems in connexion with graphs
• Shortest paths in Euclidean graphs
• Priority queues with update and finding minimum spanning trees
• Undirected single-source shortest paths with positive integer weights in linear time
• Faster algorithms for the shortest path problem
• Combining speed-up techniques for shortest-path computations
• Efficient Algorithms for Shortest Paths in Sparse Networks
• Shortest-Route Methods: 1. Reaching, Pruning, and Buckets
• Buckets, Heaps, Lists, and Monotone Priority Queues
• On RAM Priority Queues

This page was built for publication: A NOVEL LINEAR ALGORITHM FOR SHORTEST PATHS IN NETWORKS