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)- Selected Multicriteria Shortest Path Problems: An Analysis of Complexity, Models and Adaptation of Standard Algorithms
- Emergency evacuation problem for a multi-source and multi-destination transportation network: mathematical model and case study
- Finding theKth shortest path in a time-schedule network
- Near-shortest and K-shortest simple paths
- Applications of weighted automata in natural language processing
- Solving some lexicographic multi-objective combinatorial problems
- Finding \(K\) shortest looping paths in a traffic-light network
- Exact and heuristic solution approaches for the integrated job scheduling and constrained network routing problem
- Unified approach to fuzzy graph problems
- The most probable annotation problem in HMMs and its application to bioinformatics
- Computational convergence of the path integral for real dendritic morphologies
- How much the grid network and rescuers' communication can improve the rescue efficiency in worst-case analysis
- Finding the first \(K\) shortest paths in a time-window network.
- A decision-theoretic approach to robust optimization in multivalued graphs
- Choquet-based optimisation in multiobjective shortest path and spanning tree problems
- A heuristic for optimizing stochastic activity networks with applications to statistical digital circuit sizing
- Multi-objective evacuation routing in transportation networks
- Three-stage approaches for optimizing some variations of the resource constrained shortest-path sub-problem in a column generation context
- An algorithm for finding all thek-components of a digraph
- The minmax regret robust shortest path problem in a finite multi-scenario model
- Computing strictly-second shortest paths
- The one-dimensional cutting stock problem with due dates
- Solving biobjective combinatorial max-ordering problems by ranking methods and a two-phases approach
- Multicriteria path and tree problems: discussion on exact algorithms and applications
- Algorithms for shortest paths and \(d\)-cycle problems
- A fast method for discovering critical edge sequences in e-commerce catalogs
- Heuristic search for one-to-many shortest path queries
- Efficient calculation of the most reliable pair of link disjoint paths in telecommunication networks
- Finding \(K\) shortest looping paths with waiting time in a time--window network
- Splitting (complicated) surfaces is hard
- Solving the constrained shortest path problem using random search strategy
- Finding next-to-shortest paths in a graph
- Speeding up Martins' algorithm for multiple objective shortest path problems
- Minimal counterexamples for linear-time probabilistic verification
- Finding the \(K\) shortest paths in a schedule-based transit network
- An experimental study on approximating \(k\) shortest simple paths
- Solving the \(k\)-shortest path problem with time windows in a time varying network
- A branch-and-price algorithm for placement routing for a multi-head beam-type component placement tool
- Improved algorithms for the \(k\) simple shortest paths and the replacement paths problems
- A simulated annealing based genetic local search algorithm for multi-objective multicast routing problems
- scientific article; zbMATH DE number 1305420 (Why is no real title available?)
- The shortest path problem with forbidden paths
- Finding the k shortest simple paths
- Algorithm for resource allocation in data centers with independent schedulers for different types of resources
- K\(^{\ast}\): A heuristic search algorithm for finding the \(k\) shortest paths
- Implementation of algorithms forK shortest loopless paths
- Algorithms for finding the weight-constrained \(k\) longest paths in a tree and the length-constrained \(k\) maximum-sum segments of a sequence
- Finding shortest and dissimilar paths
- An efficient algorithm to find next-to-shortest path on permutation graphs
- On the cardinality of the Pareto set in bicriteria shortest path problems
- scientific article; zbMATH DE number 1982185 (Why is no real title available?)
- Theoretical insights and algorithmic tools for decision diagram-based optimization
- Computingk-shortest path lengths in euclidean networks
- An efficient implementation of an algorithm for findingK shortest simple paths
- Multiple-path selection for new highway alignments using discrete algorithms
- Deterministic Combinatorial Replacement Paths and Distance Sensitivity Oracles
- Finding the \(K\) shortest hyperpaths
- Finding the Minimum-Weight k-Path
- Constructing the nearly shortest path in crossed cubes
- Finding the \(K\) shortest paths in a time-schedule network with constraints on arcs
- Generating counterexamples for quantitative safety specifications in probabilistic B
- Network majority on tree topological network
- An exact algorithm for the robust shortest path problem with interval data
- Generalized route planning model for hazardous material transportation with VaR and equity considerations
- Fast computation of bounds for two-terminal network reliability
- Counterexample generation for discrete-time Markov models: an introductory survey
- Small-\(m\) method for detecting all longest paths
- \(k\)-shortest routing of trains on shunting yards
- Optimal shortest path set problem in undirected graphs
- On the \(K\) shortest path trees problem
- Computing and listing \(st\)-paths in public transportation networks
- An efficient best-trees algorithm for weighted tree automata over the tropical semiring
- Flows with unit path capacities and related packing and covering problems
- scientific article; zbMATH DE number 3876620 (Why is no real title available?)
- Approximating the Canadian traveller problem with online randomization
- scientific article; zbMATH DE number 2150205 (Why is no real title available?)
- Efficient meta-data structure in top-\(k\) queries of combinations and multi-item procurement auctions
- Minimal functional routes in directed graphs with dependent edges
- On the disambiguation of weighted automata
- Bounds on the complexity of halfspace intersections when the bounded faces have small dimension
- A disambiguation algorithm for weighted automata
- \(k\)-best solutions of MSO problems on tree-decomposable graphs
- Computing and listing \(st\)-paths in public transportation networks
- Efficiently Generating k-Best Solutions to Procurement Auctions
- Origin-destination matrix estimation problem in a Markov chain approach
- Priority-oriented route network planning for evacuation in constrained space scenarios
- Novel node-ranking approach for SDN-based virtual network embedding
- Finding an induced path that is not a shortest path
- Finding the \(k\) shortest paths in parallel
- Computing cyclic invariants for molecular graphs
- scientific article; zbMATH DE number 1420748 (Why is no real title available?)
- Path flow estimator in an entropy model using a nonlinear L-shaped algorithm
- Multicriteria movement synchronization scheduling problems and algorithms
- Providing Evidence of Likely Being on Time: Counterexample Generation for CTMC Model Checking
- The global optimal algorithm of reliable path finding problem based on backtracking method
- A new \(O(m+k n \log \overline{d})\) algorithm to find the \(k\) shortest paths in acyclic digraphs
- Finding the \(k\) shortest simple paths: time and space trade-offs
- On the online multi-agent O-D \(k\)-Canadian traveler problem
- Efficient single-pair all-shortest-path query processing for massive dynamic networks
- Multi-route planning of multimodal transportation for oversize and heavyweight cargo based on reconstruction
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)
