Probabilistic quickest path algorithm

DOI10.1016/j.tcs.2003.08.008zbMath1070.68152OpenAlexW2082645040WikidataQ116677319 ScholiaQ116677319MaRDI QIDQ1884944

Nageswara S. V. Rao

Publication date: 27 October 2004

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2003.08.008

zbMATH Keywords

Probabilistic algorithmsQuickest pathApproximate quickest pathPath-table

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10) Combinatorial probability (60C05) Randomized algorithms (68W20)

Related Items (2)

Fast and fine quickest path algorithm ⋮ A comprehensive survey on the quickest path problem

Cites Work

• The quickest path problem
• Algorithms for the quickest path problem and the enumeration of quickest paths
• On the quickest path problem
• The all-pairs quickest path problem
• On Source-Based Route Computation for Quickest Paths under Dynamic Bandwidth Constraints
• Unnamed Item
• Unnamed Item

This page was built for publication: Probabilistic quickest path algorithm