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
- 11557
- Venue
- VLDB
- Year
- 2017
- Pagerank
- 9.3282272e-05
- Overall Rank
- 2,192 | 84.77%
- 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,171 |
Minimal On-Road Time Route Scheduling on Time-Dependent Graphs |
2017 |
VLDB |
7.4471807e-05 |
| 4,536 |
Hop-constrained s-t Simple Path Enumeration: Towards Bridging Theory and Practice |
2020 |
VLDB |
6.099154e-05 |
| 4,620 |
Diversified Top-k Route Planning in Road Network |
2022 |
VLDB |
6.0368524e-05 |
| 4,856 |
TOAIN: A Throughput Optimizing Adaptive Index for Answering Dynamic kNN Queries on Road Networks |
2018 |
VLDB |
5.868876e-05 |
| 7,430 |
DLCR: Efficient Indexing for Label-Constrained Reachability Queries on Large Dynamic Graphs |
2022 |
VLDB |
4.7275494e-05 |
| 7,711 |
Accelerating Exact Constrained Shortest Paths on GPUs |
2021 |
VLDB |
4.6670758e-05 |
| 9,207 |
FHL-Cube: Multi-Constraint Shortest Path Querying with Flexible Combination of Constraints |
2022 |
VLDB |
4.3694476e-05 |
| 10,525 |
Efficient Indexing for Flexible Label-Constrained Shortest Path Queries in Road Networks |
2025 |
SIGMOD |
4.1905499e-05 |
| 11,201 |
QHL: A Fast Algorithm for Exact Constrained Shortest Path Search on Road Networks |
2023 |
SIGMOD |
4.1905499e-05 |
| 11,541 |
Towards an Efficient Weighted Random Walk Domination |
2021 |
VLDB |
4.1905499e-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,206 |
When Hierarchy Meets 2-Hop-Labeling: Efficient Shortest Distance Queries on Road Networks |
2018 |
SIGMOD |
9.2958349e-05 |
| 1,694 |
Shortest Path and Distance Queries on Road Networks: Towards Bridging Theory and Practice |
2013 |
SIGMOD |
0.00010870205 |
| 4,976 |
Constrained Shortest Path Query in a Large Time-Dependent Graph |
2019 |
VLDB |
5.7854051e-05 |
| 9,680 |
PCSP: Efficiently Answering Label-Constrained Shortest Path Queries in Road Networks |
2024 |
VLDB |
4.3006524e-05 |
| 2,547 |
Efficient Shortest Path Index Maintenance on Dynamic Road Networks with Theoretical Guarantees |
2020 |
VLDB |
8.5600506e-05 |
| 5,606 |
Efficient Shortest Path Counting on Large Road Networks |
2022 |
VLDB |
5.4126223e-05 |
| 10,525 |
Efficient Indexing for Flexible Label-Constrained Shortest Path Queries in Road Networks |
2025 |
SIGMOD |
4.1905499e-05 |
| 7,444 |
Efficient Label-Constrained Shortest Path Queries on Road Networks: A Tree Decomposition Approach |
2022 |
VLDB |
4.7236107e-05 |
| 11,201 |
QHL: A Fast Algorithm for Exact Constrained Shortest Path Search on Road Networks |
2023 |
SIGMOD |
4.1905499e-05 |
| 1,235 |
Graph Indexing of Road Networks for Shortest Path Queries with Label Restrictions |
2011 |
VLDB |
0.0001311113 |