Publikation: Provable Efficiency of Contraction Hierarchies with Randomized Preprocessing
Lade...
Dateien
Zu diesem Dokument gibt es keine Dateien.
Datum
2015
Autor:innen
Funke, Stefan
Herausgeber:innen
ISSN der Zeitschrift
Electronic ISSN
ISBN
Bibliografische Daten
Verlag
Schriftenreihe
Auflagebezeichnung
DOI (zitierfähiger Link)
Internationale Patentnummer
Angaben zur Forschungsförderung
Projekt
Open Access-Veröffentlichung
Core Facility der Universität Konstanz
Titel in einer weiteren Sprache
Publikationstyp
Beitrag zu einem Konferenzband
Publikationsstatus
Published
Erschienen in
ELBASSIONI, Khaled, ed., Kazuhisa MAKINO, ed.. Algorithms and Computation : 26th International Symposium, ISAAC 2015, Nagoya, Japan, December 9-11, 2015, proceedings. Heidelberg: Springer, 2015, pp. 479-490. Lecture Notes in Computer Science. 9472. ISSN 0302-9743. eISSN 1611-3349. ISBN 978-3-662-48970-3. Available under: doi: 10.1007/978-3-662-48971-0_41
Zusammenfassung
We present a new way of analyzing Contraction Hierarchies (CH), a widely used speed-up technique for shortest path computations in road networks. In previous work, preprocessing and query times of deterministically constructed CH on road networks with n nodes were shown to be polynomial in n as well as the highway dimension h of the network and its diameter D. While h is conjectured to be polylogarithmic for road networks, a tight bound remains an open problem. We rely on the empirically justifiable assumption of the road network exhibiting small growth. We introduce a method to construct randomized Contraction Hierarchies on road networks as well as a probabilistic query routine. Our analysis reveals that randomized CH lead to sublinear search space sizes in the order of √n logn √n, auxiliary data in the order of nlog2√n, and correct query results with high probability after a polynomial time preprocessing phase.
Zusammenfassung in einer weiteren Sprache
Fachgebiet (DDC)
004 Informatik
Schlagwörter
Konferenz
26th International Symposium, ISAAC 2015, 9. Dez. 2015 - 11. Dez. 2015, Nagoya, Japan
Rezension
undefined / . - undefined, undefined
Zitieren
ISO 690
FUNKE, Stefan, Sabine STORANDT, 2015. Provable Efficiency of Contraction Hierarchies with Randomized Preprocessing. 26th International Symposium, ISAAC 2015. Nagoya, Japan, 9. Dez. 2015 - 11. Dez. 2015. In: ELBASSIONI, Khaled, ed., Kazuhisa MAKINO, ed.. Algorithms and Computation : 26th International Symposium, ISAAC 2015, Nagoya, Japan, December 9-11, 2015, proceedings. Heidelberg: Springer, 2015, pp. 479-490. Lecture Notes in Computer Science. 9472. ISSN 0302-9743. eISSN 1611-3349. ISBN 978-3-662-48970-3. Available under: doi: 10.1007/978-3-662-48971-0_41BibTex
@inproceedings{Funke2015-11-27Prova-43548,
year={2015},
doi={10.1007/978-3-662-48971-0_41},
title={Provable Efficiency of Contraction Hierarchies with Randomized Preprocessing},
number={9472},
isbn={978-3-662-48970-3},
issn={0302-9743},
publisher={Springer},
address={Heidelberg},
series={Lecture Notes in Computer Science},
booktitle={Algorithms and Computation : 26th International Symposium, ISAAC 2015, Nagoya, Japan, December 9-11, 2015, proceedings},
pages={479--490},
editor={Elbassioni, Khaled and Makino, Kazuhisa},
author={Funke, Stefan and Storandt, Sabine}
}RDF
<rdf:RDF
xmlns:dcterms="http://purl.org/dc/terms/"
xmlns:dc="http://purl.org/dc/elements/1.1/"
xmlns:rdf="http://www.w3.org/1999/02/22-rdf-syntax-ns#"
xmlns:bibo="http://purl.org/ontology/bibo/"
xmlns:dspace="http://digital-repositories.org/ontologies/dspace/0.1.0#"
xmlns:foaf="http://xmlns.com/foaf/0.1/"
xmlns:void="http://rdfs.org/ns/void#"
xmlns:xsd="http://www.w3.org/2001/XMLSchema#" >
<rdf:Description rdf:about="https://kops.uni-konstanz.de/server/rdf/resource/123456789/43548">
<dcterms:issued>2015-11-27</dcterms:issued>
<dc:date rdf:datatype="http://www.w3.org/2001/XMLSchema#dateTime">2018-10-16T12:21:54Z</dc:date>
<dc:contributor>Storandt, Sabine</dc:contributor>
<dcterms:available rdf:datatype="http://www.w3.org/2001/XMLSchema#dateTime">2018-10-16T12:21:54Z</dcterms:available>
<dc:contributor>Funke, Stefan</dc:contributor>
<dc:creator>Storandt, Sabine</dc:creator>
<bibo:uri rdf:resource="https://kops.uni-konstanz.de/handle/123456789/43548"/>
<dc:language>eng</dc:language>
<dcterms:title>Provable Efficiency of Contraction Hierarchies with Randomized Preprocessing</dcterms:title>
<dcterms:isPartOf rdf:resource="https://kops.uni-konstanz.de/server/rdf/resource/123456789/36"/>
<dc:creator>Funke, Stefan</dc:creator>
<foaf:homepage rdf:resource="http://localhost:8080/"/>
<dcterms:abstract xml:lang="eng">We present a new way of analyzing Contraction Hierarchies (CH), a widely used speed-up technique for shortest path computations in road networks. In previous work, preprocessing and query times of deterministically constructed CH on road networks with n nodes were shown to be polynomial in n as well as the highway dimension h of the network and its diameter D. While h is conjectured to be polylogarithmic for road networks, a tight bound remains an open problem. We rely on the empirically justifiable assumption of the road network exhibiting small growth. We introduce a method to construct randomized Contraction Hierarchies on road networks as well as a probabilistic query routine. Our analysis reveals that randomized CH lead to sublinear search space sizes in the order of √n logn √n, auxiliary data in the order of nlog<sup>2</sup>√n, and correct query results with high probability after a polynomial time preprocessing phase.</dcterms:abstract>
<dspace:isPartOfCollection rdf:resource="https://kops.uni-konstanz.de/server/rdf/resource/123456789/36"/>
<void:sparqlEndpoint rdf:resource="http://localhost/fuseki/dspace/sparql"/>
</rdf:Description>
</rdf:RDF>Interner Vermerk
xmlui.Submission.submit.DescribeStep.inputForms.label.kops_note_fromSubmitter
Prüfungsdatum der Dissertation
Finanzierungsart
Kommentar zur Publikation
Allianzlizenz
Corresponding Authors der Uni Konstanz vorhanden
Internationale Co-Autor:innen
Universitätsbibliographie
Nein
