On Algorithms for Minimum-Cost Quickest Paths with Multiple Delay-Bounds

Kim, None Haksuh; Ahn, Byungjun; Park, Soo-Hyun; Hong, Inki; Bang, Young-Cheol

doi:10.1007/978-3-540-24707-4_126

Cited by 2 publications

(1 citation statement)

References 11 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…It is a generalization of the restricted shortest path problem which has attracted great attention in the literature (Hassin, 1992;Lorenz and Raz, 2001). Bang et al (2004) considered the related Minimum Cost Quickest Path Problem with Multiple Delay Bounds where a minimum cost path among those paths not exceeding a given transmission time has to be found.…”

Section: Introductionmentioning

confidence: 99%

Reliable and Restricted Quickest Path Problems

Ruzika

Thiemann

2011

Lecture Notes in Computer Science

View full text Add to dashboard Cite

In a dynamic network, the quickest path problem asks for a path minimizing the time needed to send a given amount of flow from source to sink along this path. In practical settings, for example in evacuation or transportation planning, the reliability of network arcs depends on the specific scenario of interest. In this circumstance, the question of finding a quickest path among all those having at least a desired path reliability arises. In this article, this reliable quickest path problem is solved by transforming it to the restricted quickest path problem. In the latter, each arc is associated a nonnegative cost value and the goal is to find a quickest path among those not exceeding a predefined budget with respect to the overall (additive) cost value. For both, the restricted and reliable quickest path problem, pseudopolynomial exact algorithms and fully polynomial-time approximation schemes are proposed.

show abstract

Section: Introductionmentioning

confidence: 99%