On the K shortest path trees problem

DOI10.1016/J.EJOR.2009.06.017zbMATH Open1176.90614OpenAlexW1964122629MaRDI QIDQ1040982FDOQ1040982

Authors Antonio Sedeño-Noda, C. González-Martín

Publication date 27 November 2009

Published in European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.ejor.2009.06.017

zbMATH Keywords

network/graphs\(K\) best solutions\(K\) best spanning tree\(K\) shortest path trees problemshortest path tree problem

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Graph algorithms (graph-theoretic aspects) (05C85)

Recommendations

• A note on \(k\)-shortest paths problem
• On the SPANNING \(k\)-TREE problem
• Approximation algorithms for somek-source shortest paths spanning tree problems
• Approximation algorithms for the shortest total path length spanning tree problem
• Near-shortest and K-shortest simple paths
• On the k Shortest Simple Paths Problem in Weighted Directed Graphs
• Finding the k Shortest Paths
• On the minimum vertex \(k\)-path cover of trees
• scientific article; zbMATH DE number 1186513
• On the \(k\)-simple shortest paths problem in weighted directed graphs

Cites work

• A Method for the Solution of the N th Best Path Problem
• A Procedure for Computing the K Best Solutions to Discrete Optimization Problems and Its Application to the Shortest Path Problem
• A bicriterion shortest path algorithm
• A new implementation of Yen's ranking loopless paths algorithm
• A note on \(K\) best network flows
• A note on two problems in connexion with graphs
• An Algorithm for Finding K Minimum Spanning Trees
• An efficient algorithm for K shortest simple paths
• An efficient implementation of an algorithm for findingK shortest simple paths
• Efficient Shortest Path Simplex Algorithms
• Finding the k shortest simple paths
• Finding the K Shortest Loopless Paths in a Network
• Implementation of algorithms forK shortest loopless paths
• Letter to the Editor—The kth Best Route Through a Network
• Network flows. Theory, algorithms, and applications.
• On a routing problem
• SHORTEST PATH SIMPLEX ALGORITHM WITH A MULTIPLE PIVOT RULE: A COMPARATIVE STUDY
• Scaling Algorithms for the Shortest Paths Problem
• Two Algorithms for Generating Weighted Spanning Trees in Order

Cited in

(15)

• Approximation algorithms for somek-source shortest paths spanning tree problems
• Multiple space debris collecting mission -- debris selection and trajectory optimization
• \(k\)-best solutions of MSO problems on tree-decomposable graphs
• On the k Shortest Simple Paths Problem in Weighted Directed Graphs
• A pathfinding problem for search trees with unknown edge length
• An \(O(Kn \log (Kn))\) algorithm for the \(K\)th best spanning tree in series parallel graphs
• scientific article; zbMATH DE number 1420748 (Why is no real title available?)
• scientific article; zbMATH DE number 7526265 (Why is no real title available?)
• scientific article; zbMATH DE number 1093953 (Why is no real title available?)
• Log-space algorithms for paths and matchings in \(k\)-trees
• A Procedure for Computing the K Best Solutions to Discrete Optimization Problems and Its Application to the Shortest Path Problem
• Enumerating \(K\) best paths in length order in DAGs
• Ranking One Million Simple Paths in Road Networks
• An efficient time and space \(K\) point-to-point shortest simple paths algorithm
• An efficient algorithm for the length-constrained heaviest path problem on a tree

This page was built for publication: On the \(K\) shortest path trees problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1040982)