Finding the \(k\) shortest simple paths: time and space trade-offs
From MaRDI portal
Publication:6579778
DOI10.1145/3626567MaRDI QIDQ6579778
Nicolas Nisse, David Coudert, Ali Al Zoobi
Publication date: 26 July 2024
Published in: ACM Journal of Experimental Algorithmics (Search for Journal in Brave)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Finding the \(K\) shortest paths in a time-schedule network with constraints on arcs
- An \(O(n^3 \log \log n / \log^2 n)\) time algorithm for all pairs shortest paths
- Improved algorithms for the \(k\) simple shortest paths and the replacement paths problems
- The pairing heap: A new form of self-adjusting heap
- Finding the \(K\) shortest paths in a schedule-based transit network
- A new approach to all-pairs shortest paths on real-weighted graphs
- Complex networks: structure and dynamics
- On algorithms for finding the k shortest paths in a network
- An efficient algorithm for K shortest simple paths
- Finding the k Shortest Paths
- An efficient implementation of an algorithm for findingK shortest simple paths
- Subcubic Equivalences Between Path, Matrix, and Triangle Problems
- A Sidetrack-Based Algorithm for Finding the k Shortest Simple Paths in a Directed Graph
- Finding k shortest simple paths in directed graphs: A node classification algorithm
- Fully Dynamic Algorithms for Maintaining Shortest Paths Trees
- Finding the k shortest simple paths
- Computing the N Best Loopless Paths in a Network
- 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
This page was built for publication: Finding the \(k\) shortest simple paths: time and space trade-offs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6579778)
