On k-Path Covers and their applications

Cite This

Files in this item

Files Size Format View

There are no files associated with this item.

FUNKE, Stefan, André NUSSER, Sabine STORANDT, 2016. On k-Path Covers and their applications. In: The VLDB Journal. 25(1), pp. 103-123. ISSN 1066-8888. eISSN 0949-877X. Available under: doi: 10.1007/s00778-015-0392-3

@article{Funke2016-02kPath-43520, title={On k-Path Covers and their applications}, year={2016}, doi={10.1007/s00778-015-0392-3}, number={1}, volume={25}, issn={1066-8888}, journal={The VLDB Journal}, pages={103--123}, author={Funke, Stefan and Nusser, André and Storandt, Sabine} }

<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/rdf/resource/123456789/43520"> <dcterms:abstract xml:lang="eng">For a directed graph G with vertex set V, we call a subset C⊆V a k-(All-)Path Cover if C contains a node from any simple path in G consisting of k nodes. This paper considers the problem of constructing small k-Path Covers in the context of road networks with millions of nodes and edges. In many application scenarios, the set C and its induced overlay graph constitute a very compact synopsis of G, which is the basis for the currently fastest data structure for personalized shortest path queries, visually pleasing overlays of subsampled paths, and efficient reporting, retrieval and aggregation of associated data in spatial network databases. Apart from a theoretic investigation of the problem, we provide efficient algorithms that produce very small k-Path Covers for large real-world road networks (with a posteriori guarantees via instance-based lower bounds). We also apply our algorithms to other (social, collaboration, web, etc.) networks and can improve in several instances upon previous approaches.</dcterms:abstract> <dcterms:isPartOf rdf:resource="https://kops.uni-konstanz.de/rdf/resource/123456789/36"/> <dc:contributor>Nusser, André</dc:contributor> <dcterms:issued>2016-02</dcterms:issued> <bibo:uri rdf:resource="https://kops.uni-konstanz.de/handle/123456789/43520"/> <dc:creator>Storandt, Sabine</dc:creator> <void:sparqlEndpoint rdf:resource="http://localhost/fuseki/dspace/sparql"/> <foaf:homepage rdf:resource="http://localhost:8080/jspui"/> <dc:language>eng</dc:language> <dcterms:title>On k-Path Covers and their applications</dcterms:title> <dc:creator>Funke, Stefan</dc:creator> <dspace:isPartOfCollection rdf:resource="https://kops.uni-konstanz.de/rdf/resource/123456789/36"/> <dcterms:available rdf:datatype="http://www.w3.org/2001/XMLSchema#dateTime">2018-10-15T09:19:17Z</dcterms:available> <dc:creator>Nusser, André</dc:creator> <dc:contributor>Storandt, Sabine</dc:contributor> <dc:contributor>Funke, Stefan</dc:contributor> <dc:date rdf:datatype="http://www.w3.org/2001/XMLSchema#dateTime">2018-10-15T09:19:17Z</dc:date> </rdf:Description> </rdf:RDF>

This item appears in the following Collection(s)

Search KOPS


Browse

My Account