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

DOI10.1016/J.ENDM.2004.03.019MaRDI QIDQ3439133zbMATH OpenOpenAlexFDO

Authors 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

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

Cites work

• A heuristic improvement of the Bellman-Ford algorithm
• A note on two problems in connexion with graphs
• A simple and fast label correcting algorithm for shortest paths
• Fibonacci heaps and their uses in improved network optimization algorithms
• scientific article; zbMATH DE number 5542185 (Why is no real title available?)
• Implementation and efficiency of Moore-algorithms for the shortest route problem
• Negative-cycle detection algorithms
• On a routing problem
• Shortest path algorithms: A computational study with the C programming language
• Shortest paths algorithms: Theory and experimental evaluation
• Shortest‐path methods: Complexity, interrelations and new propositions

Cited in

(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

Describes a project that uses

Uses Software

• Algorithm 360

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

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