Finding the k Shortest Paths
From MaRDI portal
Publication:4210169
Recommendations
- Finding the K shortest hyperpaths
- Finding shortest and dissimilar paths
- Finding \(k\) simple shortest paths and cycles
- Finding the K Shortest Loopless Paths in a Network
- Finding the k shortest simple paths
- Finding the \(k\) quickest simple paths in a network
- An efficient implementation of an algorithm for findingK shortest simple paths
- Finding the Minimum-Weight k-Path
- Near-shortest and K-shortest simple paths
Cites work
- scientific article; zbMATH DE number 3174052 (Why is no real title available?)
- scientific article; zbMATH DE number 3936534 (Why is no real title available?)
- scientific article; zbMATH DE number 3598519 (Why is no real title available?)
- scientific article; zbMATH DE number 1256641 (Why is no real title available?)
- A Note on an Algebra for the k Best Routes in a Network
- A Procedure for Computing the K Best Solutions to Discrete Optimization Problems and Its Application to the Shortest Path Problem
- A priority queue in which initialization and queue operations takeO(loglogD) time
- Algorithms for proximity problems in higher dimensions
- Algorithms for the quickest path problem and the enumeration of quickest paths
- All paths in an activity network
- An Appraisal of Some Shortest-Path Algorithms
- An algebra for determining all path-values in a network with application to K-shortest-paths problems
- An algorithm for finding the \(k\) quickest paths in a network
- An algorithm for ranking paths that may contain cycles
- An efficient algorithm for K shortest simple paths
- An optimal algorithm for selection in a min-heap
- Comment on a computing the k shortest paths in a graph
- Disjoint paths in a network
- Faster algorithms for the shortest path problem
- Faster shortest-path algorithms for planar graphs
- Fibonacci heaps and their uses in improved network optimization algorithms
- Finding Two Disjoint Paths Between Two Pairs of Vertices in a Graph
- Finding a minimum-weight k-link path in graphs with the concave Monge property and applications
- Finding the K Shortest Loopless Paths in a Network
- Finding the \(k\) quickest simple paths in a network
- Implementation of algorithms forK shortest loopless paths
- Iterative methods for determining the k shortest paths in a network
- On a routing problem
- On algorithms for finding the k shortest paths in a network
- On computing sets of shortest paths in a graph
- Scaling Algorithms for the Shortest Paths Problem
- Semirings and path spaces
- Separator based sparsification for dynamic planar graph algorithms
- Technical Note—Determining All Optimal and Near-Optimal Solutions when Solving Shortest Path Problems by Dynamic Programming
- Trans-dichotomous algorithms for minimum spanning trees and shortest paths
Cited in
(only showing first 100 items - show all)- Heuristic search for one-to-many shortest path queries
- Novel node-ranking approach for SDN-based virtual network embedding
- Minimal counterexamples for linear-time probabilistic verification
- K\(^{\ast}\): A heuristic search algorithm for finding the \(k\) shortest paths
- A heuristic for optimizing stochastic activity networks with applications to statistical digital circuit sizing
- The global optimal algorithm of reliable path finding problem based on backtracking method
- Finding \(K\) shortest looping paths with waiting time in a time--window network
- Shortest paths avoiding forbidden subpaths
- Solving the \(k\)-shortest path problem with time windows in a time varying network
- Choquet-based optimisation in multiobjective shortest path and spanning tree problems
- Finding shortest and dissimilar paths
- Optimal path selection approach for fuzzy reliable shortest path problem
- Efficiently Generating k-Best Solutions to Procurement Auctions
- Finding the K mean-standard deviation shortest paths under travel time uncertainty
- \(k\)-shortest routing of trains on shunting yards
- Theoretical insights and algorithmic tools for decision diagram-based optimization
- Implementation of algorithms forK shortest loopless paths
- scientific article; zbMATH DE number 6280003 (Why is no real title available?)
- Solving the constrained shortest path problem using random search strategy
- scientific article; zbMATH DE number 1982185 (Why is no real title available?)
- Candidate sets for alternative routes in road networks
- Low time complexity algorithms for path computation in Cayley graphs
- Origin-destination matrix estimation problem in a Markov chain approach
- Transducing Markov sequences
- The most probable annotation problem in HMMs and its application to bioinformatics
- The minmax regret robust shortest path problem in a finite multi-scenario model
- Finding a given number of solutions to a system of fuzzy constraints
- Finding the \(k\) shortest simple paths: time and space trade-offs
- scientific article; zbMATH DE number 3105908 (Why is no real title available?)
- An efficient algorithm to find next-to-shortest path on permutation graphs
- Counterexample generation for discrete-time Markov models: an introductory survey
- Computing strictly-second shortest paths
- Finding \(k\) simple shortest paths and cycles
- Path flow estimator in an entropy model using a nonlinear L-shaped algorithm
- Multicriteria movement synchronization scheduling problems and algorithms
- Development of a railway out-of-gauge freight transport routing optimal method
- scientific article; zbMATH DE number 1305420 (Why is no real title available?)
- Multi-objective evacuation routing in transportation networks
- The one-dimensional cutting stock problem with due dates
- Applications of Page Ranking in P Systems
- Finding the \(k\) shortest paths in parallel
- Fast computation of bounds for two-terminal network reliability
- Computing and listing \(st\)-paths in public transportation networks
- Fixed node determination and analysis in directed acyclic graphs of structured networks
- Multimodal K-shortest viable path problem in Tehran public transportation network and its solution applying ant colony and simulated annealing algorithms
- Computing and listing \(st\)-paths in public transportation networks
- Small-m method for detecting all longest paths
- Computingk-shortest path lengths in euclidean networks
- An efficient best-trees algorithm for weighted tree automata over the tropical semiring
- Two-best solutions under distance constraints: The model and exemplary results for matroids
- \(k\)-best solutions under distance constraints in valuated \(\Delta\)-matroids
- Efficiently listing bounded length \(st\)-paths
- Finding the k shortest simple paths
- Multi-route planning of multimodal transportation for oversize and heavyweight cargo based on reconstruction
- Algorithms for shortest paths and \(d\)-cycle problems
- A fast method for discovering critical edge sequences in e-commerce catalogs
- Efficient calculation of the most reliable pair of link disjoint paths in telecommunication networks
- The first \(K\) shortest unique-arc walks in a traffic-light network
- Finding the \(k\) shortest paths in parallel
- Applications of weighted automata in natural language processing
- Finding an induced path that is not a shortest path
- A decomposition based hybrid heuristic algorithm for the joint passenger and freight train scheduling problem
- The shortest kinship description problem
- Finding the \(K\) shortest paths in a schedule-based transit network
- Algorithms for finding the weight-constrained \(k\) longest paths in a tree and the length-constrained \(k\) maximum-sum segments of a sequence
- Algorithms for non-linear and stochastic resource constrained shortest path
- Finding theKth shortest path in a time-schedule network
- On the \(K\) shortest path trees problem
- How much the grid network and rescuers' communication can improve the rescue efficiency in worst-case analysis
- Multiple-path selection for new highway alignments using discrete algorithms
- Generalized route planning model for hazardous material transportation with VaR and equity considerations
- On a Class of Interval Data Minmax Regret CO Problems
- Multicriteria path and tree problems: discussion on exact algorithms and applications
- Finding the Minimum-Weight k-Path
- On the online multi-agent O-D \(k\)-Canadian traveler problem
- scientific article; zbMATH DE number 2150205 (Why is no real title available?)
- Selected Multicriteria Shortest Path Problems: An Analysis of Complexity, Models and Adaptation of Standard Algorithms
- Near-shortest and K-shortest simple paths
- An exact algorithm for the robust shortest path problem with interval data
- On a relaxed maximally disjoint path pair problem: a bicriteria approach
- A disambiguation algorithm for weighted automata
- Algorithm for resource allocation in data centers with independent schedulers for different types of resources
- Finding the K shortest paths in a time-schedule network with constraints on arcs
- The shortest path problem with forbidden paths
- Approximating the Canadian traveller problem with online randomization
- Improved algorithms for the \(k\) simple shortest paths and the replacement paths problems
- An experimental study on approximating \(k\) shortest simple paths
- Solving a constrained economic lot size problem by ranking efficient production policies
- Finding next-to-shortest paths in a graph
- A decision-theoretic approach to robust optimization in multivalued graphs
- Deterministic Combinatorial Replacement Paths and Distance Sensitivity Oracles
- Efficient single-pair all-shortest-path query processing for massive dynamic networks
- Enumerating \(K\) best paths in length order in DAGs
- Splitting (complicated) surfaces is hard
- Combination of piecewise-geodesic paths for interactive segmentation
- Flows with unit path capacities and related packing and covering problems
- Finding \(K\) dissimilar paths: single-commodity and discretized flow formulations
- Balanced-flow algorithm for path network planning in hierarchical spaces
- Blazing a trail via matrix multiplications: a faster algorithm for non-shortest induced paths
- On the disambiguation of weighted automata
This page was built for publication: Finding the k Shortest Paths
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4210169)
