PRACTICAL EFFICIENCIES OF EXISTING SHORTEST-PATH ALGORITHMS AND A NEW BUCKET ALGORITHM

DOI10.15807/JORSJ.27.43zbMATH Open0532.90091OpenAlexW2184006489MaRDI QIDQ3315293FDOQ3315293

Authors Masao Iri, Hideki Imai 

Publication date 1984

Published in Journal of the Operations Research Society of Japan (Search for Journal in Brave)

Full work available at URL https://doi.org/10.15807/jorsj.27.43

zbMATH Keywords

shortest pathscomparison of algorithmsbucket algorithmlabel- correcting methodlabel-setting method

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Programming involving graphs or networks (90C35) Analysis of algorithms and problem complexity (68Q25) Deterministic network models in operations research (90B10) Extremal problems in graph theory (05C35)

Recommendations

• Shortest paths algorithms: Theory and experimental evaluation
• scientific article; zbMATH DE number 1003284
• scientific article; zbMATH DE number 1766771
• scientific article; zbMATH DE number 5039783
• Design and implementation of a practical I/O-efficient shortest paths algorithm
• Shortest-path feasibility algorithms, an experimental evaluation
• An Appraisal of Some Shortest-Path Algorithms
• A Practical Shortest Path Algorithm with Linear Expected Time
• Shortest‐path methods: Complexity, interrelations and new propositions
• An efficient implementation of an algorithm for findingK shortest simple paths

Cited In (3)

• A Practical Shortest Path Algorithm with Linear Expected Time
• A computational study of efficient shortest path algorithms
• Title not available (Why is no real title available?)

This page was built for publication: PRACTICAL EFFICIENCIES OF EXISTING SHORTEST-PATH ALGORITHMS AND A NEW BUCKET ALGORITHM

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