Finding the k Shortest Paths (Q4210169): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding a minimum-weight \(k\)-link path in graphs with the concave Monge property and applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Faster algorithms for the shortest path problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: All paths in an activity network / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4165410 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On a routing problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Technical Note—Determining All Optimal and Near-Optimal Solutions when Solving Shortest Path Problems by Dynamic Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: An algorithm for finding the \(k\) quickest paths in a network / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding the \(k\) quickest simple paths in a network / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms for proximity problems in higher dimensions / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Appraisal of Some Shortest-Path Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Separator based sparsification for dynamic planar graph algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4230327 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3292914 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An optimal algorithm for selection in a min-heap / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fibonacci heaps and their uses in improved network optimization algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Trans-dichotomous algorithms for minimum spanning trees and shortest paths / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scaling Algorithms for the Shortest Paths Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A priority queue in which initialization and queue operations takeO(loglogD) time / rank
 
Normal rank
Property / cites work
 
Property / cites work: An efficient algorithm for K shortest simple paths / rank
 
Normal rank
Property / cites work
 
Property / cites work: Faster shortest-path algorithms for planar graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Procedure for Computing the <i>K</i> Best Solutions to Discrete Optimization Problems and Its Application to the Shortest Path Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Comment on a computing the k shortest paths in a graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: An algorithm for ranking paths that may contain cycles / rank
 
Normal rank
Property / cites work
 
Property / cites work: On computing sets of shortest paths in a graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Note on an Algebra for the <i>k</i> Best Routes in a Network / rank
 
Normal rank
Property / cites work
 
Property / cites work: Implementation of algorithms forK shortest loopless paths / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding Two Disjoint Paths Between Two Pairs of Vertices in a Graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms for the quickest path problem and the enumeration of quickest paths / rank
 
Normal rank
Property / cites work
 
Property / cites work: On algorithms for finding the k shortest paths in a network / rank
 
Normal rank
Property / cites work
 
Property / cites work: Iterative methods for determining the k shortest paths in a network / rank
 
Normal rank
Property / cites work
 
Property / cites work: Disjoint paths in a network / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3707420 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An algebra for determining all path-values in a network with application to K-shortest-paths problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Semirings and path spaces / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding the <i>K</i> Shortest Loopless Paths in a Network / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 15:10, 28 May 2024

scientific article; zbMATH DE number 1200808
Language Label Description Also known as
English
Finding the k Shortest Paths
scientific article; zbMATH DE number 1200808

    Statements

    Finding the k Shortest Paths (English)
    0 references
    0 references
    21 September 1998
    0 references
    shortest paths
    0 references
    network programming
    0 references
    path enumeration
    0 references
    near-optimal solutions
    0 references
    dynamic programming
    0 references
    knapsack problem
    0 references
    sequence alignment
    0 references
    inscribed polygon
    0 references
    genealogy
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references