An efficient time and space \(K\) point-to-point shortest simple paths algorithm

DOI10.1016/j.amc.2012.04.002zbMath1253.65098OpenAlexW2073296515MaRDI QIDQ449479

Antonio Sedeño-Noda

Publication date: 30 August 2012

Published in: Applied Mathematics and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.amc.2012.04.002

zbMATH Keywords

\(K\) best shortest simple pathspoint-to-point shortest pathsranking best solutions

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05)

Related Items (3)

An efficient time and space \(K\) point-to-point shortest simple paths algorithm ⋮ Ranking One Million Simple Paths in Road Networks ⋮ N-gram distribution and unification gain problem and its optimal solution

Uses Software

• DIMACS

Cites Work

• Unnamed Item
• A note on two problems in connexion with graphs
• An efficient time and space \(K\) point-to-point shortest simple paths algorithm
• Solving k-shortest and constrained shortest path problems efficiently
• A comparison of solution strategies for biobjective shortest path problems
• Improved algorithms for the \(k\) simple shortest paths and the replacement paths problems
• A bicriterion shortest path algorithm
• A new implementation of Yen's ranking loopless paths algorithm
• Shortest paths algorithms: Theory and experimental evaluation
• SHORTEST PATH SIMPLEX ALGORITHM WITH A MULTIPLE PIVOT RULE: A COMPARATIVE STUDY
• Letter to the Editor—The kth Best Route Through a Network
• A Method for the Solution of the N th Best Path Problem
• Implementation of algorithms forK shortest loopless paths
• An efficient algorithm for K shortest simple paths
• Two Algorithms for Generating Weighted Spanning Trees in Order
• An efficient implementation of an algorithm for findingK shortest simple paths
• Finding the k shortest simple paths
• Near-shortest and K-shortest simple paths
• Finding the K Shortest Loopless Paths in a Network
• A Procedure for Computing the K Best Solutions to Discrete Optimization Problems and Its Application to the Shortest Path Problem
• Automata, Languages and Programming

This page was built for publication: An efficient time and space \(K\) point-to-point shortest simple paths algorithm