On the second point-to-point undirected shortest simple path problem

DOI10.1007/S11590-012-0528-YMaRDI QIDQ395858zbMATH OpenOpenAlexFDO

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

Publication date 30 January 2014

Published in Optimization Letters (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s11590-012-0528-y

zbMATH Keywords

effective reduced costpoint-to-point undirected shortest simple pathsecond best solutionshortest paths

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35)

Recommendations

• An efficient time and space K point-to-point shortest simple paths algorithm
• Computing strictly-second shortest paths
• A simpler and more efficient algorithm for the next-to-shortest path problem
• A Simpler and More Efficient Algorithm for the Next-to-Shortest Path Problem
• Shortest shortest path trees of a network

Cites work

• A note on two problems in connexion with graphs
• A Shortest Path Algorithm for Real-Weighted Undirected Graphs
• An efficient algorithm for K shortest simple paths
• Finding next-to-shortest paths in a graph
• Network flows. Theory, algorithms, and applications.
• Tight bounds for worst-case equilibria
• Undirected single-source shortest paths with positive integer weights in linear time

Cited in

(3)

• A simpler and more efficient algorithm for the next-to-shortest path problem
• Computing strictly-second shortest paths
• On the complexity of finding paths in a two-dimensional domain I: Shortest paths

This page was built for publication: On the second point-to-point undirected shortest simple path problem

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