On k-Path Covers and their Applications
Summary: Defines k-(All-)Path Covers and builds covers for large road networks, yielding compact synopses and overlays for fast path queries. Offers instance-based lower bounds with a posteriori guarantees; algorithms deliver compact overlays for reporting and spatial queries. (summarized by gpt-5-nano on Feb 09 2026)
Incoming Non-self Citations Over Time
Authors
- 1. Stefan Funke
- 2. André Nusser
- 3. Sabine Storandt
Incoming Citations (Sorted by Pagerank)
Showing 4 of 4 citing papers.
| Rank | Citing Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 2,188 | Effective Indexing for Approximate Constrained Shortest Path Queries on Large Road Networks | 2017 | VLDB | 9.3372315e-05 |
| 6,743 | Utility-Aware Ridesharing on Road Networks | 2017 | SIGMOD | 4.9430196e-05 |
| 8,885 | Bonding Vertex Sets Over Distributed Graph: A Betweenness Aware Approach | 2015 | VLDB | 4.4282232e-05 |
| 11,413 | Online Ridesharing with Meeting Points | 2022 | VLDB | 4.1945683e-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,054 | On k-skip Shortest Paths | 2011 | SIGMOD | 0.00014422699 |
Previous
Page 1 / 1
Next
Semantically Similar Papers
| Overall Rank | Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 10,515 | Divide-and-Conquer: Scalable Shortest Path Counting on Large Road Networks | 2025 | SIGMOD | 4.1945683e-05 |
| 2,547 | Efficient Shortest Path Index Maintenance on Dynamic Road Networks with Theoretical Guarantees | 2020 | VLDB | 8.5683079e-05 |
| 5,508 | Fast Large-Scale Trajectory Clustering | 2020 | VLDB | 5.4713696e-05 |
| 10,171 | High-Throughput k Nearest Neighbors Search in Road Networks | 2026 | SIGMOD | 4.1945683e-05 |
| 1,230 | Graph Indexing of Road Networks for Shortest Path Queries with Label Restrictions | 2011 | VLDB | 0.00013150837 |
| 788 | Efficiently Answering Reachability Queries on Very Large Directed Graphs | 2008 | SIGMOD | 0.00016650034 |
| 4,067 | Efficient Processing of Distance Queries in Large Graphs: A Vertex Cover Approach | 2012 | SIGMOD | 6.4795399e-05 |
| 4,621 | Diversified Top-k Route Planning in Road Network | 2022 | VLDB | 6.0426586e-05 |
| 5,597 | Efficient Shortest Path Counting on Large Road Networks | 2022 | VLDB | 5.4178241e-05 |
| 1,054 | On k-skip Shortest Paths | 2011 | SIGMOD | 0.00014422699 |