On the k-simple shortest paths problem in weighted directed graphs
From MaRDI portal
Publication:2934682
zbMATH Open1302.05093MaRDI QIDQ2934682FDOQ2934682
Recommendations
- On the k Shortest Simple Paths Problem in Weighted Directed Graphs
- A sidetrack-based algorithm for finding the \(k\) shortest simple paths in a directed graph
- Finding \(k\) simple shortest paths and cycles
- Improved algorithms for the \(k\) simple shortest paths and the replacement paths problems
- An experimental study on approximating \(k\) shortest simple paths
Cited in
(15)- Finding \(k\) simple shortest paths and cycles
- The next‐to‐shortest path problem on directed graphs with positive edge weights
- Efficiently listing bounded length \(st\)-paths
- On the \(K\) shortest path trees problem
- Maintaining shortest paths under deletions in weighted directed graphs
- On the k Shortest Simple Paths Problem in Weighted Directed Graphs
- An experimental study on approximating \(k\) shortest simple paths
- An experimental study on approximating \(k\) shortest simple paths
- Improved algorithms for the \(k\) simple shortest paths and the replacement paths problems
- Flows with unit path capacities and related packing and covering problems
- Algorithms and Data Structures
- Finding \(k\) shortest simple paths in directed graphs: a node classification algorithm
- Generic single edge fault tolerant exact distance oracle
- A sidetrack-based algorithm for finding the \(k\) shortest simple paths in a directed graph
- On the weights of simple paths in weighted complete graphs
This page was built for publication: On the \(k\)-simple shortest paths problem in weighted directed graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2934682)
