http://www.colloquiam.com/wd/index.php?action=history&feed=atom&title=Delling_2008aDelling 2008a - Revision history2026-05-11T05:18:50ZRevision history for this page on the wikiMediaWiki 1.27.0-wmf.10http://www.colloquiam.com/wd/index.php?title=Delling_2008a&diff=173548&oldid=prevScipediacontent: Scipediacontent moved page Draft Content 677875435 to Delling 2008a2020-10-14T10:56:24Z<p>Scipediacontent moved page <a href="/public/Draft_Content_677875435" class="mw-redirect" title="Draft Content 677875435">Draft Content 677875435</a> to <a href="/public/Delling_2008a" title="Delling 2008a">Delling 2008a</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 10:56, 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=Delling_2008a&diff=173547&oldid=prevScipediacontent: Created page with " == Abstract == During the last years, many speed-up techniques for Dijkstra 's algorithm have been developed. As a result, computing a shortest path in a staticroad network..."2020-10-14T10:56:21Z<p>Created page with " == Abstract == During the last years, many speed-up techniques for Dijkstra 's algorithm have been developed. As a result, computing a shortest path in a staticroad network..."</p>
<p><b>New page</b></p><div><br />
== Abstract ==<br />
<br />
During the last years, many speed-up techniques for Dijkstra 's algorithm have been developed. As a result, computing a shortest path in a staticroad network is a matter of microseconds. However, only few of those techniques work in time-dependentnetworks. Unfortunately, such networks appear frequentely in reality: Roads are predictably congestured by traffic jams, and efficient timetable information systems rely on time-dependent networks. Hence, a fast technique for routing in such networks is needed. In this work, we present an exacttime-dependent speed-up technique based on our recent SHARC-algorithm. As a result, we are able to efficiently compute shortest paths in time-dependent continental-sized transportation networks, both of roads and of railways.<br />
<br />
Document type: Part of book or chapter of book<br />
<br />
== Full document ==<br />
<pdf>Media:Draft_Content_677875435-beopen245-6799-document.pdf</pdf><br />
<br />
<br />
== Original document ==<br />
<br />
The different versions of the original document can be found in:<br />
<br />
* [http://i11www.iti.uni-karlsruhe.de/extra/publications/d-tdsr-09.pdf http://i11www.iti.uni-karlsruhe.de/extra/publications/d-tdsr-09.pdf]</div>Scipediacontent