An efficient algorithm for K shortest simple paths
From MaRDI portal
Cites work
- scientific article; zbMATH DE number 3473265 (Why is no real title available?)
- A Method for the Solution of the N th Best Path Problem
- CalculatingKth Shortest Paths
- Computational experience with an algorithm for finding the k shortest paths in a network
- Efficient Algorithms for Shortest Paths in Sparse Networks
Cited in
(49)- On the second point-to-point undirected shortest simple path problem
- Finding \(K\) shortest looping paths with waiting time in a time--window network
- Solving the \(k\)-shortest path problem with time windows in a time varying network
- Voronoi diagrams with barriers and on polyhedra for minimal path planning
- A new exact algorithm for the vehicle routing problem based on \(q\)-paths and \(k\)-shortest paths relaxations
- Finding the \(k\) shortest simple paths: time and space trade-offs
- k-shortest simple paths in bounded treewidth graphs
- The k most vital arcs in the shortest path problem
- Finding the \(k\) shortest paths in parallel
- Computing and listing \(st\)-paths in public transportation networks
- Computing and listing \(st\)-paths in public transportation networks
- Efficiently listing bounded length \(st\)-paths
- An efficient time and space K point-to-point shortest simple paths algorithm
- The first K shortest unique-arc walks in a traffic-light network
- An exact lexicographic approach for the maximally risk-disjoint/minimal cost path pair problem in telecommunication networks
- Any-k algorithms for enumerating ranked answers to conjunctive queries
- Computational experiments with a lazy version of a \(K\) quickest simple path ranking algorithm
- Finding the \(K\) shortest paths in a schedule-based transit network
- First passage percolation on locally treelike networks. I. Dense random graphs
- On the \(K\) shortest path trees problem
- How much the grid network and rescuers' communication can improve the rescue efficiency in worst-case analysis
- The hierarchical network design problem
- Multicriteria path and tree problems: discussion on exact algorithms and applications
- An algorithm for finding the \(k\) quickest paths in a network
- Improved algorithms for replacement paths problems in restricted graphs
- Finding the \(k\) quickest simple paths in a network
- Deviation algorithms for ranking shortest paths
- Approximating the Canadian traveller problem with online randomization
- Improved algorithms for the \(k\) simple shortest paths and the replacement paths problems
- Multiobjective routing problems
- An experimental study on approximating k shortest simple paths
- Enumerating \(K\) best paths in length order in DAGs
- An algorithm for ranking quickest simple paths
- Finding \(K\) dissimilar paths: single-commodity and discretized flow formulations
- Finding the k Shortest Paths
- Ranking One Million Simple Paths in Road Networks
- An interactive approach to identify the best compromise solution for two objective shortest path problems
- \(k\)-best solutions of MSO problems on tree-decomposable graphs
- A new \(O(m+k n \log \overline{d})\) algorithm to find the \(k\) shortest paths in acyclic digraphs
- On finding dissimilar paths
- A comprehensive survey on the quickest path problem
- Finding the first \(K\) shortest paths in a time-window network.
- Distance confined path problem and separable integer programming
- Finding \(K\) shortest looping paths in a traffic-light network
- Internet packet routing: application of a K-quickest path algorithm
- Optimal shortest path set problem in undirected graphs
- Element perturbation problems of optimum spanning trees with two-parameter objectives
- An algorithm for determining the k-best solutions of the one-dimensional knapsack problem
- Three-stage approaches for optimizing some variations of the resource constrained shortest-path sub-problem in a column generation context
This page was built for publication: An efficient algorithm for K shortest simple paths
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3956415)
