http://www.colloquiam.com/wd/index.php?action=history&feed=atom&title=Ruzika_Thiemann_2011aRuzika Thiemann 2011a - Revision history2026-05-11T21:38:06ZRevision history for this page on the wikiMediaWiki 1.27.0-wmf.10http://www.colloquiam.com/wd/index.php?title=Ruzika_Thiemann_2011a&diff=176114&oldid=prevScipediacontent: Scipediacontent moved page Draft Content 948601846 to Ruzika Thiemann 2011a2020-10-14T14:29:26Z<p>Scipediacontent moved page <a href="/public/Draft_Content_948601846" class="mw-redirect" title="Draft Content 948601846">Draft Content 948601846</a> to <a href="/public/Ruzika_Thiemann_2011a" title="Ruzika Thiemann 2011a">Ruzika Thiemann 2011a</a></p>
<table class="diff diff-contentalign-left" data-mw="interface">
<tr style='vertical-align: top;' lang='en'>
<td colspan='1' style="background-color: white; color:black; text-align: center;">← Older revision</td>
<td colspan='1' style="background-color: white; color:black; text-align: center;">Revision as of 14:29, 14 October 2020</td>
</tr><tr><td colspan='2' style='text-align: center;' lang='en'><div class="mw-diff-empty">(No difference)</div>
</td></tr></table>Scipediacontenthttp://www.colloquiam.com/wd/index.php?title=Ruzika_Thiemann_2011a&diff=176113&oldid=prevScipediacontent: Created page with " == Abstract == 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...."2020-10-14T14:29:24Z<p>Created page with " == Abstract == 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...."</p>
<p><b>New page</b></p><div><br />
== Abstract ==<br />
<br />
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.<br />
<br />
Document type: Part of book or chapter of book<br />
<br />
== Full document ==<br />
<pdf>Media:Draft_Content_948601846-beopen1023-7545-document.pdf</pdf><br />
<br />
<br />
== Original document ==<br />
<br />
The different versions of the original document can be found in:<br />
<br />
* [https://kluedo.ub.uni-kl.de/files/2288/Reliable_and_Restricted_Quickest_Paths.pdf https://kluedo.ub.uni-kl.de/files/2288/Reliable_and_Restricted_Quickest_Paths.pdf]</div>Scipediacontent