An efficient label setting/correcting shortest path algorithm

DOI10.1007/s10589-010-9323-9zbMath1244.90236OpenAlexW2017706785MaRDI QIDQ434184

Carlos González-Martín, Antonio Sedeño-Noda

Publication date: 10 July 2012

Published in: Computational Optimization and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10589-010-9323-9

zbMATH Keywords

design and analysis of algorithmsdistance algorithmsnetwork/graphspseudo permanent labels

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35)

Related Items (1)

Finding the shortest path by evolving junctions on obstacle boundaries (E-JOB): an initial value ODE's approach

Cites Work

• Unnamed Item
• A note on two problems in connexion with graphs
• New efficient shortest path simplex algorithm: Pseudo permanent labels instead of permanent labels
• Negative-cycle detection algorithms
• Shortest paths algorithms: Theory and experimental evaluation
• A heuristic improvement of the Bellman-Ford algorithm
• On a routing problem
• A New Polynomially Bounded Shortest Path Algorithm
• Shortest‐path methods: Complexity, interrelations and new propositions
• A simple and fast label correcting algorithm for shortest paths
• Implementation and efficiency of Moore-algorithms for the shortest route problem
• Scaling Algorithms for the Shortest Paths Problem

This page was built for publication: An efficient label setting/correcting shortest path algorithm