Two-Levels-Greedy: a generalization of Dijkstra's shortest path algorithm (Q3439133): Difference between revisions

@@ Property / DOI @@
-.1016/j.endm.2004.03.019
@@ Property / DOI: 10.1016/j.endm.2004.03.019 / rank @@
-Normal rank
@@ Property / cites work @@
+On a routing problem
@@ Property / cites work: On a routing problem / rank @@
+Normal rank
@@ Property / cites work @@
+A simple and fast label correcting algorithm for shortest paths
+Normal rank
@@ Property / cites work @@
+Negative-cycle detection algorithms
@@ Property / cites work: Negative-cycle detection algorithms / rank @@
+Normal rank
@@ Property / cites work @@
+Shortest paths algorithms: Theory and experimental evaluation
+Normal rank
@@ Property / cites work @@
+Q3619797
@@ Property / cites work: Q3619797 / rank @@
+Normal rank
@@ Property / cites work @@
+A note on two problems in connexion with graphs
@@ Property / cites work: A note on two problems in connexion with graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Fibonacci heaps and their uses in improved network optimization algorithms
+Normal rank
@@ Property / cites work @@
+A heuristic improvement of the Bellman-Ford algorithm
+Normal rank
@@ Property / cites work @@
+Shortest path algorithms: A computational study with the C programming language
+Normal rank
@@ Property / cites work @@
+Shortest‐path methods: Complexity, interrelations and new propositions
+Normal rank
@@ Property / cites work @@
+Implementation and efficiency of Moore-algorithms for the shortest route problem
+Normal rank
@@ Property / DOI @@
+.1016/J.ENDM.2004.03.019
@@ Property / DOI: 10.1016/J.ENDM.2004.03.019 / rank @@
+Normal rank