Probabilistic quickest path algorithm

DOI10.1016/J.TCS.2003.08.008MaRDI QIDQ1884944zbMATH OpenOpenAlexWikidataFDO

Authors N. 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

Approximate quickest pathPath-tableProbabilistic algorithmsQuickest path

Mathematics Subject Classification ID

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

Recommendations

• Algorithms for the quickest path problem and the reliable quickest path problem
• On the quickest path problem
• An algorithm for finding the \(k\) quickest paths in a network
• On algorithm for all-pairs most reliable quickest paths
• Finding the \(k\) quickest simple paths in a network

Cites work

• Algorithms for the quickest path problem and the enumeration of quickest paths
• scientific article; zbMATH DE number 5542185 (Why is no real title available?)
• On Source-Based Route Computation for Quickest Paths under Dynamic Bandwidth Constraints
• On the quickest path problem
• The all-pairs quickest path problem
• The nature of statistical learning theory.
• The quickest path problem

Cited in

(5)

• A comprehensive survey on the quickest path problem
• Fast and fine quickest path algorithm
• On Source-Based Route Computation for Quickest Paths under Dynamic Bandwidth Constraints
• On algorithms for minimum-cost quickest paths with multiple delay-bounds
• On algorithm for all-pairs most reliable quickest paths

This page was built for publication: Probabilistic quickest path algorithm

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