Shortest paths algorithms: Theory and experimental evaluation

1996/05/01 by Boris V. Cherkassky, Andrew V. Goldberg, Tomasz Radzik · 1 citation
Computer Science · Mathematics · #Algorithm #Complexity and Algorithms in Graphs #Computational Geometry and Mesh Generation #Computer science #Graph #Implementation #Mathematical optimization #Mathematics #Optimization and Search Problems #Shortest path problem #Strengths and weaknesses #Theoretical computer science

paper · doi:10.1007/bf02592101

crossref issued 1996/05/01 · crossref published 1996/05/01 · crossref published-print 1996/05/01 · openalex publication_date 1996/05/01 · crossref created 2007/03/29 · crossref deposited 2019/05/20 · openalex created_date 2025/10/10 · crossref indexed 2026/08/04 · openalex updated_date 2026/08/04

Citations

• Data Structures and Network Algorithms
• Fibonacci heaps and their uses in improved network optimization algorithms
• Combinatorial optimization: networks and matroids
• A note on two problems in connexion with graphs

Cited by

• D-ary heap [wikipedia]