Sciweavers

Share
VLDB
2016
ACM

On k-Path Covers and their applications

3 years 9 days ago
On k-Path Covers and their applications
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 path 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 theoretical 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).
Stefan Funke, André Nusser, Sabine Storandt
Added 11 Apr 2016
Updated 11 Apr 2016
Type Journal
Year 2016
Where VLDB
Authors Stefan Funke, André Nusser, Sabine Storandt
Comments (0)
books