Position Paper: Dijkstra's Algorithm versus Uniform Cost Search or a Case Against Dijkstra's Algorithm
作者： Ariel Felner
DOI:
关键词: Logical equivalence 、 Position paper 、 Artificial intelligence 、 A* search algorithm 、 Dijkstra's algorithm 、 Simple (abstract algebra) 、 Computer science 、 Scheme (programming language) 、 Focus (optics)
摘要: … In this section I give the simplest possible description of Dijkstra’s algorithm (DA) as provided in the common textbook ”Introduction to algorithms” (Cormen et al. 2001) and other …
参考文章(6)
Moshe Sniedovich, Dijkstra's algorithm revisited: the dynamic programming connexion Control and Cybernetics. ,vol. 35, pp. 599- 620 ,(2006)
Ariel Felner, Uzi Zahavi, Robert Holte, Jonathan Schaeffer, Nathan Sturtevant, Zhifu Zhang, Inconsistent heuristics in theory and practice Artificial Intelligence. ,vol. 175, pp. 1570- 1603 ,(2011) , 10.1016/J.ARTINT.2011.02.001
E. W. Dijkstra, A note on two problems in connexion with graphs Numerische Mathematik. ,vol. 1, pp. 269- 271 ,(1959) , 10.1007/BF01386390
John E. Hopcroft, Jeffrey Ullman, Alfred V. Aho, Data Structures and Algorithms ,(1983)
Boris V. Cherkassky, Andrew V. Goldberg, Tomasz Radzik, Shortest paths algorithms: theory and experimental evaluation Mathematical Programming. ,vol. 73, pp. 129- 174 ,(1996) , 10.1007/BF02592101
M.Komp, Adhi Harmoko S, Joseph Marie Jacquard, Eniac, Konrad Zuse, Introduction to Algorithms ,(2005)