Hierarchical speed-up techniques for shortest-path algorithms

Zitieren

Dateien zu dieser Ressource

Prüfsumme: MD5:404e12b0cee91e220deb3b8a502c03be

HOLZER, Martin, 2003. Hierarchical speed-up techniques for shortest-path algorithms

@mastersthesis{Holzer2003Hiera-6098, title={Hierarchical speed-up techniques for shortest-path algorithms}, year={2003}, author={Holzer, Martin} }

application/pdf Hierarchical speed-up techniques for shortest-path algorithms Holzer, Martin eng Holzer, Martin Shortest-path problems occur in many fields of application, where the graphs are often<br />very large and queries have to be answered in 'real-time'. This cannot be overcome by the<br />classical algorithm of Dijkstra but requires more sophisticated speed-up techniques. One approach<br />consists of hierarchical decomposition of a given graph and pre-computation of information in order<br />to reduce search space during the on-line stage.<br /><br />One such technique applied to a specific scenario was recently investigated in a systematic<br />experimental study. In the following work, we follow up and give a detailed analysis of this speed-up technique along with experiments using several graph classes. 2011-03-24T16:09:32Z 2003 deposit-license 2011-03-24T16:09:32Z

Dateiabrufe seit 01.10.2014 (Informationen über die Zugriffsstatistik)

da_finished.pdf 54

Das Dokument erscheint in:

KOPS Suche


Stöbern

Mein Benutzerkonto