Publikation:

Polynomial-time Construction of Contraction Hierarchies for Multi-criteria Objectives

Vorschaubild

Dateien

Zu diesem Dokument gibt es keine Dateien.

Datum

2013

Autor:innen

Funke, Stefan

Herausgeber:innen

Kontakt

ISSN der Zeitschrift

Electronic ISSN

ISBN

Bibliografische Daten

Verlag

Schriftenreihe

Auflagebezeichnung

URI (zitierfähiger Link)
DOI (zitierfähiger Link)
https://doi.org/10.1137/1.9781611972931.4
ArXiv-ID

Internationale Patentnummer

Angaben zur Forschungsförderung

Projekt

Open Access-Veröffentlichung

Sammlungen

Informatik und Informationswissenschaft: Publikationen
Core Facility der Universität Konstanz

Gesperrt bis

Titel in einer weiteren Sprache

Publikationstyp
Beitrag zu einem Konferenzband
Publikationsstatus
Published

Erschienen in

SANDERS, Peter, ed., Norbert ZEH, ed.. 2013 Proceedings of the Fifteenth Workshop on Algorithm Engineering and Experiments (ALENEX). Philadelphia, PA: SIAM, 2013, pp. 41-54. ISBN 978-1-61197-253-5. Available under: doi: 10.1137/1.9781611972931.4

Zusammenfassung

We consider multicriteria shortest path problems and show that contraction hierarchies — a very powerful speed-up technique originally developed for standard shortest path queries in [7] — can be constructed efficiently for the case of arbitrary conic combinations of the edge costs. This extends previous results in [5] which considered only the bicriteria case and discrete weights for the objective functions. On the theory side we prove a polynomial time bound for determining whether a path π is part of the lower envelope of all pareto-optimal paths via some polyhedral arguments. Experiments complement these results by showing the practicability of our approach.

Zusammenfassung in einer weiteren Sprache

Fachgebiet (DDC)
004 Informatik

Schlagwörter

Konferenz

The Fifteenth Workshop on Algorithm Engineering and Experiments (ALENEX), 7. Jan. 2013, New Orleans, Louisiana
Rezension
undefined / . - undefined, undefined

Forschungsvorhaben

Organisationseinheiten

Zeitschriftenheft

Zugehörige Datensätze in KOPS

Zitieren

ISO 690FUNKE, Stefan, Sabine STORANDT, 2013. Polynomial-time Construction of Contraction Hierarchies for Multi-criteria Objectives. The Fifteenth Workshop on Algorithm Engineering and Experiments (ALENEX). New Orleans, Louisiana, 7. Jan. 2013. In: SANDERS, Peter, ed., Norbert ZEH, ed.. 2013 Proceedings of the Fifteenth Workshop on Algorithm Engineering and Experiments (ALENEX). Philadelphia, PA: SIAM, 2013, pp. 41-54. ISBN 978-1-61197-253-5. Available under: doi: 10.1137/1.9781611972931.4
BibTex
@inproceedings{Funke2013-12-18Polyn-45929,
  year={2013},
  doi={10.1137/1.9781611972931.4},
  title={Polynomial-time Construction of Contraction Hierarchies for Multi-criteria Objectives},
  isbn={978-1-61197-253-5},
  publisher={SIAM},
  address={Philadelphia, PA},
  booktitle={2013 Proceedings of the Fifteenth Workshop on Algorithm Engineering and Experiments (ALENEX)},
  pages={41--54},
  editor={Sanders, Peter and Zeh, Norbert},
  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/45929">
    <dc:contributor>Funke, Stefan</dc:contributor>
    <dc:date rdf:datatype="http://www.w3.org/2001/XMLSchema#dateTime">2019-05-28T12:39:43Z</dc:date>
    <dc:creator>Storandt, Sabine</dc:creator>
    <dc:contributor>Storandt, Sabine</dc:contributor>
    <dcterms:available rdf:datatype="http://www.w3.org/2001/XMLSchema#dateTime">2019-05-28T12:39:43Z</dcterms:available>
    <void:sparqlEndpoint rdf:resource="http://localhost/fuseki/dspace/sparql"/>
    <dcterms:title>Polynomial-time Construction of Contraction Hierarchies for Multi-criteria Objectives</dcterms:title>
    <dcterms:isPartOf rdf:resource="https://kops.uni-konstanz.de/server/rdf/resource/123456789/36"/>
    <foaf:homepage rdf:resource="http://localhost:8080/"/>
    <bibo:uri rdf:resource="https://kops.uni-konstanz.de/handle/123456789/45929"/>
    <dspace:isPartOfCollection rdf:resource="https://kops.uni-konstanz.de/server/rdf/resource/123456789/36"/>
    <dc:creator>Funke, Stefan</dc:creator>
    <dcterms:abstract xml:lang="eng">We consider multicriteria shortest path problems and show that contraction hierarchies — a very powerful speed-up technique originally developed for standard shortest path queries in [7] — can be constructed efficiently for the case of arbitrary conic combinations of the edge costs. This extends previous results in [5] which considered only the bicriteria case and discrete weights for the objective functions. On the theory side we prove a polynomial time bound for determining whether a path π is part of the lower envelope of all pareto-optimal paths via some polyhedral arguments. Experiments complement these results by showing the practicability of our approach.</dcterms:abstract>
    <dc:language>eng</dc:language>
    <dcterms:issued>2013-12-18</dcterms:issued>
  </rdf:Description>
</rdf:RDF>

Interner Vermerk

xmlui.Submission.submit.DescribeStep.inputForms.label.kops_note_fromSubmitter

Kontakt
URL der Originalveröffentl.

Prüfdatum der URL

Prüfungsdatum der Dissertation

Finanzierungsart

Kommentar zur Publikation

Allianzlizenz
Corresponding Authors der Uni Konstanz vorhanden
Internationale Co-Autor:innen
Universitätsbibliographie
Nein
Begutachtet
Diese Publikation teilen