Back to papers
Effective Indexing for Approximate Constrained Shortest Path Queries on Large Road Networks
Summary: COLA: approximate CSP for large road networks using partitioning and boundary-vertex landmarks. Alpha-Dijk inside partitions prunes via landmarks; delivers sub-second CSP queries on continental graphs with large speedups, even without an index.
(summarized by gpt-5-nano on Feb 09 2026)
- Paper ID
- 11556
- Venue
- VLDB
- Year
- 2017
- Pagerank
- 9.3372315e-05
- Overall Rank
- 2,188 | 84.79%
- DOI
-
-
Incoming Non-self Citations Over Time
Incoming Citations (Sorted by Pagerank)
Showing 10 of 10 citing papers.
| Rank |
Citing Paper |
Year |
Venue |
Pagerank |
| 3,164 |
Minimal On-Road Time Route Scheduling on Time-Dependent Graphs |
2017 |
VLDB |
7.4543722e-05 |
| 4,534 |
Hop-constrained s-t Simple Path Enumeration: Towards Bridging Theory and Practice |
2020 |
VLDB |
6.1049756e-05 |
| 4,621 |
Diversified Top-k Route Planning in Road Network |
2022 |
VLDB |
6.0426586e-05 |
| 4,854 |
TOAIN: A Throughput Optimizing Adaptive Index for Answering Dynamic kNN Queries on Road Networks |
2018 |
VLDB |
5.8743687e-05 |
| 7,428 |
DLCR: Efficient Indexing for Label-Constrained Reachability Queries on Large Dynamic Graphs |
2022 |
VLDB |
4.7320892e-05 |
| 7,712 |
Accelerating Exact Constrained Shortest Paths on GPUs |
2021 |
VLDB |
4.6715558e-05 |
| 9,205 |
FHL-Cube: Multi-Constraint Shortest Path Querying with Flexible Combination of Constraints |
2022 |
VLDB |
4.3736393e-05 |
| 10,516 |
Efficient Indexing for Flexible Label-Constrained Shortest Path Queries in Road Networks |
2025 |
SIGMOD |
4.1945683e-05 |
| 11,199 |
QHL: A Fast Algorithm for Exact Constrained Shortest Path Search on Road Networks |
2023 |
SIGMOD |
4.1945683e-05 |
| 11,537 |
Towards an Efficient Weighted Random Walk Domination |
2021 |
VLDB |
4.1945683e-05 |
Outgoing Citations (Sorted by Pagerank)
Showing 5 of 5 cited papers.
Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.
Semantically Similar Papers
| Overall Rank |
Paper |
Year |
Venue |
Pagerank |
| 2,201 |
When Hierarchy Meets 2-Hop-Labeling: Efficient Shortest Distance Queries on Road Networks |
2018 |
SIGMOD |
9.3048105e-05 |
| 1,690 |
Shortest Path and Distance Queries on Road Networks: Towards Bridging Theory and Practice |
2013 |
SIGMOD |
0.00010904736 |
| 4,973 |
Constrained Shortest Path Query in a Large Time-Dependent Graph |
2019 |
VLDB |
5.7909705e-05 |
| 9,680 |
PCSP: Efficiently Answering Label-Constrained Shortest Path Queries in Road Networks |
2024 |
VLDB |
4.3047774e-05 |
| 2,547 |
Efficient Shortest Path Index Maintenance on Dynamic Road Networks with Theoretical Guarantees |
2020 |
VLDB |
8.5683079e-05 |
| 5,597 |
Efficient Shortest Path Counting on Large Road Networks |
2022 |
VLDB |
5.4178241e-05 |
| 10,516 |
Efficient Indexing for Flexible Label-Constrained Shortest Path Queries in Road Networks |
2025 |
SIGMOD |
4.1945683e-05 |
| 7,444 |
Efficient Label-Constrained Shortest Path Queries on Road Networks: A Tree Decomposition Approach |
2022 |
VLDB |
4.7281454e-05 |
| 11,199 |
QHL: A Fast Algorithm for Exact Constrained Shortest Path Search on Road Networks |
2023 |
SIGMOD |
4.1945683e-05 |
| 1,230 |
Graph Indexing of Road Networks for Shortest Path Queries with Label Restrictions |
2011 |
VLDB |
0.00013150837 |