Retracted: A novel pseudo‐polynomial approach for shortest paths problems

[1]  Aristides Gionis,et al.  Fast shortest path distance estimation in large networks , 2009, CIKM.

[2]  Rajeev Raman,et al.  Recent results on the single-source shortest paths problem , 1997, SIGA.

[3]  Donald B. Johnson,et al.  Priority Queues with Update and Finding Minimum Spanning Trees , 1975, Inf. Process. Lett..

[4]  Edsger W. Dijkstra,et al.  A note on two problems in connexion with graphs , 1959, Numerische Mathematik.

[5]  Bernhard Haeupler,et al.  Round- and Message-Optimal Distributed Graph Algorithms , 2018, PODC.

[6]  E. Denardo,et al.  Shortest-Route Methods: 1. Reaching, Pruning, and Buckets , 1979, Oper. Res..

[7]  Jon M. Kleinberg,et al.  Triangulation and Embedding Using Small Sets of Beacons , 2004, FOCS.

[8]  Peter Sanders,et al.  Goal-directed shortest-path queries using precomputed cluster distances , 2010, JEAL.

[9]  Dorothea Wagner,et al.  Partitioning graphs to speedup Dijkstra's algorithm , 2007, ACM J. Exp. Algorithmics.

[10]  Robert E. Tarjan,et al.  Relaxed heaps: an alternative to Fibonacci heaps with applications to parallel computation , 1988, CACM.

[11]  Danupon Nanongkai,et al.  A Faster Distributed Single-Source Shortest Paths Algorithm , 2017, 2018 IEEE 59th Annual Symposium on Foundations of Computer Science (FOCS).

[12]  Mikkel Thorup,et al.  Undirected single-source shortest paths with positive integer weights in linear time , 1999, JACM.

[13]  Amr Elmasry,et al.  A new algorithm for the shortest-path problem , 2019, Networks.

[14]  Michael L. Fredman,et al.  Surpassing the Information Theoretic Bound with Fusion Trees , 1993, J. Comput. Syst. Sci..

[15]  Peter Sanders,et al.  Engineering highway hierarchies , 2012, JEAL.

[16]  Daniel Delling,et al.  Round-Based Public Transit Routing , 2015 .

[17]  Mikkel Thorup,et al.  Approximate distance oracles , 2005, J. ACM.

[18]  Dragan Vasiljevic,et al.  A Novel Linear Algorithm for Shortest Paths in Networks , 2013, Asia Pac. J. Oper. Res..

[19]  Rolf H. Möhring,et al.  Acceleration of Shortest Path and Constrained Shortest Path Computation , 2005, WEA.

[20]  Robert E. Tarjan,et al.  Fibonacci heaps and their uses in improved network optimization algorithms , 1987, JACM.

[21]  Torben Hagerup,et al.  Improved Shortest Paths on the Word RAM , 2000, ICALP.

[22]  Zhen Hu,et al.  Robust Interval-Based minimax-Regret Analysis Method for filter Management of fluid Power System , 2013, Asia Pac. J. Oper. Res..

[23]  Mohsen Ghaffari,et al.  Improved distributed algorithms for exact shortest paths , 2018, STOC.

[24]  Kurt Mehlhorn,et al.  Faster algorithms for the shortest path problem , 1990, JACM.

[25]  Andrew V. Goldberg,et al.  A Simple Shortest Path Algorithm with Linear Average Time , 2001, ESA.

[26]  Andrew V. Goldberg,et al.  Shortest paths algorithms: Theory and experimental evaluation , 1994, SODA '94.

[27]  Dorothea Wagner,et al.  Engineering Multi-Level Overlay Graphs for Shortest-Path Queries , 2006, ALENEX.

[28]  Dragan Vasiljevic,et al.  Handling ties in heuristics for the permutation flow shop scheduling problem , 2015 .

[29]  Mikkel Thorup,et al.  On RAM priority queues , 1996, SODA '96.

[30]  Rajeev Raman,et al.  Priority Queues: Small, Monotone and Trans-dichotomous , 1996, ESA.

[31]  Donald B. Johnson,et al.  Efficient Algorithms for Shortest Paths in Sparse Networks , 1977, J. ACM.

[32]  Nils J. Nilsson,et al.  A Formal Basis for the Heuristic Determination of Minimum Cost Paths , 1968, IEEE Trans. Syst. Sci. Cybern..

[33]  Michael L. Fredman,et al.  BLASTING through the information theoretic barrier with FUSION TREES , 1990, STOC '90.

[34]  Karsten Weihe,et al.  Dijkstra's algorithm on-line: an empirical case study from public railroad transport , 2000, JEAL.

[35]  Peter Sanders,et al.  Combining hierarchical and goal-directed speed-up techniques for dijkstra's algorithm , 2008, JEAL.