A simple and fast label correcting algorithm for shortest paths

DOI10.1002/net.3230230808zbMath0801.90111OpenAlexW2166739719MaRDI QIDQ4291478

Dimitri P. Bertsekas

Publication date: 9 May 1994

Published in: Networks (Search for Journal in Brave)

Full work available at URL: http://hdl.handle.net/1721.1/3256

zbMATH Keywords

shortest pathlabel correcting methodsDijkstra's algorithm

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35)

Related Items (14)

Parallel asynchronous label-correcting methods for shortest paths ⋮ Extending string similarity join to tolerant fuzzy token matching ⋮ Shortest paths in time-dependent FIFO networks ⋮ The interactive analysis of the multicriteria shortest path problem by the reference point method. ⋮ An efficient label setting/correcting shortest path algorithm ⋮ Optimal paths in bi-attribute networks with fractional cost functions ⋮ Parallel asynchronous algorithms for the \(K\) shortest paths problem ⋮ A new approximation algorithm for obtaining the probability distribution function for project completion time ⋮ Combined bus and driver scheduling ⋮ Shortest path tour problem with time windows ⋮ A dynamic programming algorithm for solving the \(k\)-color shortest path problem ⋮ From diffuse damage to strain localization from an eikonal non-local (ENL) continuum damage model with evolving internal length ⋮ Two-Levels-Greedy: a generalization of Dijkstra's shortest path algorithm ⋮ Solving the shortest path tour problem

Cites Work

• Unnamed Item
• Shortest path methods: A unifying approach
• Properties of Labeling Methods for Determining Shortest Path Trees

This page was built for publication: A simple and fast label correcting algorithm for shortest paths