Finding k-shortest paths with limited overlap

Cite This

Files in this item

Checksum: MD5:4d56bbd8538ae7c63793aa5f0749c15b

CHONDROGIANNIS, Theodoros, Panagiotis BOUROS, Johann GAMPER, Ulf LESER, David B. BLUMENTHAL, 2020. Finding k-shortest paths with limited overlap. In: The VLDB Journal. Springer. 29(5), pp. 1023-1047. ISSN 1066-8888. eISSN 0949-877X. Available under: doi: 10.1007/s00778-020-00604-x

@article{Chondrogiannis2020-09Findi-49276, title={Finding k-shortest paths with limited overlap}, year={2020}, doi={10.1007/s00778-020-00604-x}, number={5}, volume={29}, issn={1066-8888}, journal={The VLDB Journal}, pages={1023--1047}, author={Chondrogiannis, Theodoros and Bouros, Panagiotis and Gamper, Johann and Leser, Ulf and Blumenthal, David B.} }

<rdf:RDF xmlns:dcterms="" xmlns:dc="" xmlns:rdf="" xmlns:bibo="" xmlns:dspace="" xmlns:foaf="" xmlns:void="" xmlns:xsd="" > <rdf:Description rdf:about=""> <dc:language>eng</dc:language> <dc:creator>Bouros, Panagiotis</dc:creator> <dc:contributor>Chondrogiannis, Theodoros</dc:contributor> <dspace:isPartOfCollection rdf:resource=""/> <dcterms:issued>2020-09</dcterms:issued> <dc:creator>Gamper, Johann</dc:creator> <foaf:homepage rdf:resource="http://localhost:8080/jspui"/> <dc:creator>Leser, Ulf</dc:creator> <dcterms:title>Finding k-shortest paths with limited overlap</dcterms:title> <dc:creator>Blumenthal, David B.</dc:creator> <dcterms:available rdf:datatype="">2020-04-23T13:01:36Z</dcterms:available> <dc:contributor>Gamper, Johann</dc:contributor> <dc:rights>Attribution 4.0 International</dc:rights> <void:sparqlEndpoint rdf:resource="http://localhost/fuseki/dspace/sparql"/> <dc:creator>Chondrogiannis, Theodoros</dc:creator> <dc:contributor>Bouros, Panagiotis</dc:contributor> <dcterms:hasPart rdf:resource=""/> <bibo:uri rdf:resource=""/> <dspace:hasBitstream rdf:resource=""/> <dcterms:abstract xml:lang="eng">In this paper, we investigate the computation of alternative paths between two locations in a road network. More specifically, we study the k-shortest paths with limited overlap (kSPwLO kSPwLO ) problem that aims at finding a set of k paths such that all paths are sufficiently dissimilar to each other and as short as possible. To compute kSPwLO kSPwLO queries, we propose two exact algorithms, termed OnePass and MultiPass, and we formally prove that MultiPass is optimal in terms of complexity. We also study two classes of heuristic algorithms: (a) performance-oriented heuristic algorithms that trade shortness for performance, i.e., they reduce query processing time, but do not guarantee that the length of each subsequent result is minimum; and (b) completeness-oriented heuristic algorithms that trade dissimilarity for completeness, i.e., they relax the similarity constraint to return a result that contains exactly k paths. An extensive experimental analysis on real road networks demonstrates the efficiency of our proposed solutions in terms of runtime and quality of the result.</dcterms:abstract> <dc:contributor>Leser, Ulf</dc:contributor> <dcterms:rights rdf:resource=""/> <dcterms:isPartOf rdf:resource=""/> <dc:contributor>Blumenthal, David B.</dc:contributor> <dc:date rdf:datatype="">2020-04-23T13:01:36Z</dc:date> </rdf:Description> </rdf:RDF>

Downloads since Apr 23, 2020 (Information about access statistics)

Chondrogiannis_2-76tlg703mdvs7.pdf 162

This item appears in the following Collection(s)

Attribution 4.0 International Except where otherwise noted, this item's license is described as Attribution 4.0 International

Search KOPS


My Account