Stochastic shortest path with unlimited hops

DOI10.1016/j.ipl.2008.11.003zbMath1191.68880OpenAlexW2084268366MaRDI QIDQ976100

Ananya Das, Charles U. 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

zbMATH Keywords

shortest pathonline algorithmsstochastic networkgraph algorithms

Mathematics Subject Classification ID

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

Cites Work

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

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