Two-Levels-Greedy: a generalization of Dijkstra's shortest path algorithm

DOI10.1016/j.endm.2004.03.019zbMath1152.90631OpenAlexW2059940612MaRDI QIDQ3439133

Domenico Cantone, Simone Faro

Publication date: 29 May 2007

Published in: Electronic Notes in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.endm.2004.03.019

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Analysis of algorithms and problem complexity (68Q25)

Related Items (2)

Dijkstra's algorithm for solving the shortest path problem on networks under intuitionistic fuzzy environment ⋮ Fast shortest-paths algorithms in the presence of few destinations of negative-weight arcs

Uses Software

• Algorithm 360

Cites Work

• Unnamed Item
• A note on two problems in connexion with graphs
• Shortest path algorithms: A computational study with the C programming language
• Negative-cycle detection algorithms
• Shortest paths algorithms: Theory and experimental evaluation
• A heuristic improvement of the Bellman-Ford algorithm
• On a routing problem
• Shortest‐path methods: Complexity, interrelations and new propositions
• A simple and fast label correcting algorithm for shortest paths
• Implementation and efficiency of Moore-algorithms for the shortest route problem
• Fibonacci heaps and their uses in improved network optimization algorithms

This page was built for publication: Two-Levels-Greedy: a generalization of Dijkstra's shortest path algorithm