On k-Path Covers and their Applications
Summary: Introduces k-path covers—vertex sets hitting every k-node directed path—and studies compact construction for massive road networks. Efficient algorithms yield tiny overlays powering personalized shortest paths and spatial-data queries, with instance-based lower bounds. (summarized by gpt-5.6-luna on Jul 24 2026)
Incoming Non-self Citations Over Time
Authors
- 1. Stefan Funke (University of Stuttgart)
- 2. André Nusser (University of Stuttgart)
- 3. Sabine Storandt (University of Freiburg)
BibTeX Citation
@article{funke_vldb14,
title = {{On k-Path Covers and their Applications}},
author = {Funke, Stefan and Nusser, André and Storandt, Sabine},
journal = {PVLDB},
series = {{VLDB} '14},
volume = {7},
number = {10},
pages = {893--904},
doi = {10.14778/2733004.2733012},
url = {https://doi.org/10.14778/2733004.2733012},
year = {2014}
}Incoming Citations (Sorted by Pagerank)
Showing 4 of 4 citing papers.
| Rank | Citing Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 2,602 | Effective Indexing for Approximate Constrained Shortest Path Queries on Large Road Networks | 2017 | VLDB | 8.2325477e-05 |
| 6,972 | Utility-Aware Ridesharing on Road Networks | 2017 | SIGMOD | 5.6308281e-05 |
| 9,183 | Bonding Vertex Sets Over Distributed Graph: A Betweenness Aware Approach | 2015 | VLDB | 5.2116262e-05 |
| 11,919 | Online Ridesharing with Meeting Points | 2022 | VLDB | 4.9793485e-05 |
Previous
Page 1 / 1
Next
Outgoing Citations (Sorted by Pagerank)
Showing 1 of 1 cited papers.
Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.
| Rank | Cited Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 1,426 | On k-skip Shortest Paths | 2011 | SIGMOD | 0.00010710481 |
Previous
Page 1 / 1
Next
Semantically Similar Papers
| # | Overall Rank | Paper | Year | Venue |
|---|---|---|---|---|
| 1 | 11,204 | Divide-and-Conquer: Scalable Shortest Path Counting on Large Road Networks | 2025 | SIGMOD |
| 2 | 2,141 | Efficient Shortest Path Index Maintenance on Dynamic Road Networks with Theoretical Guarantees | 2020 | VLDB |
| 3 | 5,011 | Fast Large-Scale Trajectory Clustering | 2020 | VLDB |
| 4 | 10,647 | High-Throughput k Nearest Neighbors Search in Road Networks | 2026 | SIGMOD |
| 5 | 1,269 | Graph Indexing of Road Networks for Shortest Path Queries with Label Restrictions | 2011 | VLDB |
| 6 | 774 | Efficiently Answering Reachability Queries on Very Large Directed Graphs | 2008 | SIGMOD |
| 7 | 3,934 | Efficient Processing of Distance Queries in Large Graphs: A Vertex Cover Approach | 2012 | SIGMOD |
| 8 | 4,906 | Diversified Top-k Route Planning in Road Network | 2022 | VLDB |
| 9 | 5,336 | Efficient Shortest Path Counting on Large Road Networks | 2022 | VLDB |
| 10 | 1,426 | On k-skip Shortest Paths | 2011 | SIGMOD |