The all-pairs quickest path problem
From MaRDI portal
Publication:2366074
DOI10.1016/0020-0190(93)90214-TzbMath0768.68049OpenAlexW2092162762MaRDI QIDQ2366074
Publication date: 29 June 1993
Published in: Information Processing Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0020-0190(93)90214-t
capacityanalysis of algorithmsdirected graphdata structuresgraph algorithmscommunication networkshortest path problemquickest path problem
Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Paths and cycles (05C38) Graph algorithms (graph-theoretic aspects) (05C85) Data structures (68P05)
Related Items (33)
Probabilistic quickest path algorithm ⋮ Fast and fine quickest path algorithm ⋮ Calculation of minimal capacity vectors through \(k\) minimal paths under budget and time constraints ⋮ A comprehensive survey on the quickest path problem ⋮ ESTIMATED AND ACCURATE SYSTEM RELIABILITIES OF A MAINTAINABLE COMPUTER NETWORK SUBJECT TO MAINTENANCE BUDGET ⋮ Reliability of spare routing via intersectional minimal paths within budget and time constraints by simulation ⋮ An efficient alternative to the exact evaluation of the quickest path flow network reliability problem ⋮ Min‐Max quickest path problems ⋮ Routing scheme of a multi-state computer network employing a retransmission mechanism within a time threshold ⋮ Algorithms for the quickest time distribution of dynamic stochastic-flow networks ⋮ The inverse-parametric knapsack problem ⋮ A method to evaluate routing policy through \(p\) minimal paths for stochastic case ⋮ System reliability for quickest path problems under time threshold and budget ⋮ Unnamed Item ⋮ On the sum-max bicriterion path problem. ⋮ Stochastic flow networks via multiple paths under time threshold and budget constraint ⋮ Backup reliability assessment within tolerable packet error rate for a multi-state unreliable vertex computer network ⋮ Distribution and reliability evaluation of MAX-flow in dynamic multi-state flow networks ⋮ Spare routing problem with \(p\) minimal paths for time-based stochastic flow networks ⋮ On transmission time through \(k\) minimal paths of a capacitated-flow network ⋮ System Reliability Assessment throughpMinimal Paths in Stochastic Case with Backup-routing ⋮ Reliability evaluation subject to assured accuracy rate and time for stochastic unreliable-node computer networks ⋮ Time version of the shortest path problem in a stochastic-flow network ⋮ Reliability based assignment in stochastic-flow freight network ⋮ Backup reliability of stochastic imperfect-node computer networks subject to packet accuracy rate and time constraints ⋮ Assessment of spare reliability for multi-state computer networks within tolerable packet unreliability ⋮ Reliability evaluation of a computer network in cloud computing environment subject to maintenance budget ⋮ Fast data transmission and maximal dynamic flow. ⋮ Optimal flow and capacity allocation in multiple joint quickest paths of directed networks ⋮ Reliability evaluation of a multistate network subject to time constraint under routing policy ⋮ Spare Reliability for Capacitated Computer Networks Under Tolerable Error Rate and Latency Considerations ⋮ The Maximum Capacity Shortest Path Problem: Generation of Efficient Solution Sets ⋮ Extend the quickest path problem to the system reliability evaluation for a stochastic-flow network
Cites Work
This page was built for publication: The all-pairs quickest path problem
