An algorithm for finding the k quickest paths in a network
From MaRDI portal
(Redirected from Publication:1201855)
An algorithm for finding the \(k\) quickest paths in a network
An algorithm for finding the \(k\) quickest paths in a network
Recommendations
Cites work
- scientific article; zbMATH DE number 3558962 (Why is no real title available?)
- Algorithms for the quickest path problem and the enumeration of quickest paths
- An Appraisal of Some Shortest-Path Algorithms
- An efficient algorithm for K shortest simple paths
- Data Structures and Computer Science Techniques in Operations Research
- Fibonacci heaps and their uses in improved network optimization algorithms
- Finding the K Shortest Loopless Paths in a Network
- On algorithms for finding the k shortest paths in a network
- Shortest-path algorithms: Taxonomy and annotation
- The quickest path problem
Cited in
(36)- Spare routing problem with \(p\) minimal paths for time-based stochastic flow networks
- scientific article; zbMATH DE number 1182573 (Why is no real title available?)
- Optimal flow and capacity allocation in multiple joint quickest paths of directed networks
- Calculation of minimal capacity vectors through \(k\) minimal paths under budget and time constraints
- Reliability evaluation of a multistate network subject to time constraint under routing policy
- Network reliability for multipath TCP networks with a retransmission mechanism under the time constraint
- Fast and fine quickest path algorithm
- System reliability assessment through \(p\) minimal paths in stochastic case with backup-routing
- The Maximum Capacity Shortest Path Problem: Generation of Efficient Solution Sets
- Backup reliability of stochastic imperfect-node computer networks subject to packet accuracy rate and time constraints
- Algorithms for the quickest path problem and the enumeration of quickest paths
- Finding the \(k\) quickest simple paths in a network
- System reliability for quickest path problems under time threshold and budget
- On the sum-max bicriterion path problem.
- The quickest path problem with batch constraints.
- Spare reliability for capacitated computer networks under tolerable error rate and latency considerations
- Reliability evaluation subject to assured accuracy rate and time for stochastic unreliable-node computer networks
- Assessment of spare reliability for multi-state computer networks within tolerable packet unreliability
- Backup reliability assessment within tolerable packet error rate for a multi-state unreliable vertex computer network
- A branch and price algorithm to solve the quickest multicommodity \(k\)-splittable flow problem
- The quickest path problem with interval lead times
- Routing scheme of a multi-state computer network employing a retransmission mechanism within a time threshold
- Extend the quickest path problem to the system reliability evaluation for a stochastic-flow network
- An algorithm for ranking quickest simple paths
- Probabilistic quickest path algorithm
- Finding the k Shortest Paths
- Time version of the shortest path problem in a stochastic-flow network
- A method to evaluate routing policy through \(p\) minimal paths for stochastic case
- A comprehensive survey on the quickest path problem
- On transmission time through \(k\) minimal paths of a capacitated-flow network
- Fast data transmission and maximal dynamic flow.
- Stochastic flow networks via multiple paths under time threshold and budget constraint
- Faster algorithm to find anti-risk path between two nodes of an undirected graph
- Reliability of spare routing via intersectional minimal paths within budget and time constraints by simulation
- An efficient implementation of an algorithm for findingK shortest simple paths
- A novel linear algorithm for shortest paths in networks
This page was built for publication: An algorithm for finding the \(k\) quickest paths in a network
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1201855)
