A novel pseudo‐polynomial approach for shortest path problems

DOI10.1002/net.22027OpenAlexW4248120715MaRDI QIDQ6087148

Milos Danilovic, Unnamed Author, Dragan Vasiljević

Publication date: 11 December 2023

Published in: Networks (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/net.22027

zbMATH Keywords

bucketspriority queuesheapssingle source problemweight ratio

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35)

Cites Work

• A note on two problems in connexion with graphs
• Priority queues with update and finding minimum spanning trees
• Surpassing the information theoretic bound with fusion trees
• Shortest paths algorithms: Theory and experimental evaluation
• A NOVEL LINEAR ALGORITHM FOR SHORTEST PATHS IN NETWORKS
• Undirected single-source shortest paths with positive integer weights in linear time
• Faster algorithms for the shortest path problem
• Partitioning graphs to speedup Dijkstra's algorithm
• Approximate distance oracles
• Efficient Algorithms for Shortest Paths in Sparse Networks
• Shortest-Route Methods: 1. Reaching, Pruning, and Buckets
• On RAM Priority Queues
• Priority queues: Small, monotone and trans-dichotomous
• Shortest-path queries in static networks
• Round- and Message-Optimal Distributed Graph Algorithms
• Fibonacci heaps and their uses in improved network optimization algorithms
• Improved distributed algorithms for exact shortest paths
• Engineering Multi-Level Overlay Graphs for Shortest-Path Queries
• Goal Directed Shortest Path Queries Using Precomputed Cluster Distances
• Combining hierarchical and goal-directed speed-up techniques for dijkstra's algorithm
• Engineering Highway Hierarchies
• Dijkstra's algorithm on-line
• Algorithms – ESA 2005
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: A novel pseudo‐polynomial approach for shortest path problems