Label-correcting shortest path algorithms revisisted

MaRDI QIDQ3447231zbMATH OpenFDO

Authors María G. Bardossy, Douglas R. Shier

Publication date 28 June 2007

zbMATH Keywords

label-correcting algorithmoperation countssharpness

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35)

Recommendations

• A simple and fast label correcting algorithm for shortest paths
• The shortest path problem on large-scale real-road networks
• Shortest path algorithms using dynamic breadth‐first search
• An efficient label setting/correcting shortest path algorithm
• A new variant of the partitioning shortest path algorithm

Cited in

(5)

• A new variant of the partitioning shortest path algorithm
• Engineering Label-Constrained Shortest-Path Algorithms
• A simple and fast label correcting algorithm for shortest paths
• Improved preprocessing, labeling and scaling algorithms for the Weight-Constrained Shortest Path Problem
• Labeling algorithm for the shortest path problem with turn prohibitions with application to large-scale road networks

This page was built for publication: Label-correcting shortest path algorithms revisisted

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