Stochastic shortest path with unlimited hops

DOI10.1016/J.IPL.2008.11.003zbMATH Open1191.68880OpenAlexW2084268366MaRDI QIDQ976100FDOQ976100

Authors: Ananya Das, Chip Martel 

Publication date: 16 June 2010

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ipl.2008.11.003

Recommendations

• Stochastic shortest paths with recourse
• Finding the shortest path in stochastic networks
• Stochastic shortest path problems with recourse
• Variations on the stochastic shortest path problem
• scientific article; zbMATH DE number 1808552
• An Analysis of Stochastic Shortest Path Problems
• Technical Note—A Note on the Stochastic Shortest Route Problem
• Stochastic Shortest Paths Via Quasi-convex Maximization
• Randomized shortest paths with net flows and capacity constraints

zbMATH Keywords

online algorithmsgraph algorithmsshortest pathstochastic network

Mathematics Subject Classification ID

Online algorithms; streaming algorithms (68W27) Graph algorithms (graph-theoretic aspects) (05C85)

Cites Work

• On the online shortest path problem with limited arc cost dependencies
• Stochastic Shortest Paths Via Quasi-convex Maximization
• Shortest paths in stochastic networks with correlated link costs
• Arriving on time
• The dynamic shortest path problem with anticipation

Cited In (1)

• A note on detecting unbounded instances of the online shortest path problem

This page was built for publication: Stochastic shortest path with unlimited hops

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