Back to papers
Diversified Top-k Route Planning in Road Network
Summary: Diversified top-k routes for OD pairs under a similarity cap; minimize total length. Proposes edge deviation/concatenation to avoid heavy graph search; constant-time path-similarity with pruning; completeness- and efficiency-oriented acceleration.
(summarized by gpt-5-nano on Feb 09 2026)
- Paper ID
- 12800
- Venue
- VLDB
- Year
- 2022
- Pagerank
- 6.0426586e-05
- Overall Rank
- 4,621 | 67.86%
- DOI
-
10.14778/3551793.3551863
Incoming Non-self Citations Over Time
Incoming Citations (Sorted by Pagerank)
Showing 4 of 4 citing papers.
Outgoing Citations (Sorted by Pagerank)
Showing 12 of 12 cited papers.
Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.
| Rank |
Cited Paper |
Year |
Venue |
Pagerank |
| 260 |
Fast Exact Shortest-Path Distance Queries on Large Networks by Pruned Landmark Labeling |
2013 |
SIGMOD |
0.00030040036 |
| 1,024 |
Path Problems in Temporal Graphs |
2014 |
VLDB |
0.00014609643 |
| 1,555 |
Efficient Route Planning on Public Transportation Networks: A Labelling Approach |
2015 |
SIGMOD |
0.00011395261 |
| 2,188 |
Effective Indexing for Approximate Constrained Shortest Path Queries on Large Road Networks |
2017 |
VLDB |
9.3372315e-05 |
| 2,201 |
When Hierarchy Meets 2-Hop-Labeling: Efficient Shortest Distance Queries on Road Networks |
2018 |
SIGMOD |
9.3048105e-05 |
| 2,520 |
A Unified Approach to Route Planning for Shared Mobility |
2018 |
VLDB |
8.6069685e-05 |
| 3,164 |
Minimal On-Road Time Route Scheduling on Time-Dependent Graphs |
2017 |
VLDB |
7.4543722e-05 |
| 4,430 |
Finding the Cost-Optimal Path with Time Constraint over Time-Dependent Graphs |
2014 |
VLDB |
6.1942479e-05 |
| 4,542 |
Distributed Processing of k Shortest Path Queries over Dynamic Road Networks |
2020 |
SIGMOD |
6.1019408e-05 |
| 6,494 |
An Experimental Evaluation and Guideline for Path Finding in Weighted Dynamic Network |
2021 |
VLDB |
5.0417258e-05 |
| 6,973 |
The Simpler The Better: An Indexing Approach for Shared-Route Planning Queries |
2020 |
VLDB |
4.878479e-05 |
| 9,205 |
FHL-Cube: Multi-Constraint Shortest Path Querying with Flexible Combination of Constraints |
2022 |
VLDB |
4.3736393e-05 |
Semantically Similar Papers
| Overall Rank |
Paper |
Year |
Venue |
Pagerank |
| 10,171 |
High-Throughput k Nearest Neighbors Search in Road Networks |
2026 |
SIGMOD |
4.1945683e-05 |
| 3,699 |
Adaptive Fastest Path Computation on a Road Network: A Traffic Mining Approach |
2007 |
VLDB |
6.8337468e-05 |
| 5,597 |
Efficient Shortest Path Counting on Large Road Networks |
2022 |
VLDB |
5.4178241e-05 |
| 5,508 |
Fast Large-Scale Trajectory Clustering |
2020 |
VLDB |
5.4713696e-05 |
| 8,527 |
Simpler is More: Efficient Top-K Nearest Neighbors Search on Large Road Networks |
2024 |
VLDB |
4.4937074e-05 |
| 1,170 |
Shortest Path and Distance Queries on Road Networks: An Experimental Evaluation |
2012 |
VLDB |
0.00013511856 |
| 10,669 |
Customization Meets 2-Hop Labeling: Efficient Routing in Road Networks |
2025 |
VLDB |
4.1945683e-05 |
| 8,952 |
Efficient Algorithms for Finding Optimal Meeting Point on Road Networks |
2011 |
VLDB |
4.423107e-05 |
| 6,503 |
Progressive Top-K Nearest Neighbors Search in Large Road Networks |
2020 |
SIGMOD |
5.0357715e-05 |
| 11,242 |
Effective and Efficient Route Planning Using Historical Trajectories on Road Networks |
2023 |
VLDB |
4.1945683e-05 |