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)
Incoming Non-self Citations Over Time
Authors
- 1. Zihan Luo (Hong Kong University of Science and Technology)
- 2. Lei Li (Hong Kong University of Science and Technology)
- 3. Mengxuan Zhang (Iowa State University)
- 4. Wen Hua (University of Queensland)
- 5. Yehong Xu (Hong Kong University of Science and Technology)
- 6. Xiaofang Zhou (Hong Kong University of Science and Technology)
BibTeX Citation
@article{luo_vldb22,
title = {{Diversified Top-k Route Planning in Road Network}},
author = {Luo, Zihan and Li, Lei and Zhang, Mengxuan and Hua, Wen and Xu, Yehong and Zhou, Xiaofang},
journal = {PVLDB},
series = {{VLDB} '22},
volume = {15},
number = {11},
pages = {3199--3212},
doi = {10.14778/3551793.3551863},
url = {https://doi.org/10.14778/3551793.3551863},
year = {2022}
}
Incoming Citations (Sorted by Pagerank)
Showing 4 of 4 citing papers.
| Rank | Citing Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 10,683 | Bursting Flow Query on Large Temporal Flow Networks | 2025 | SIGMOD | 5.093636e-05 |
| 10,915 | Beyond Shortest Paths: Node Fairness in Route Recommendation | 2025 | VLDB | 5.093636e-05 |
| 11,347 | Expanding Reverse Nearest Neighbors | 2024 | VLDB | 5.093636e-05 |
| 11,442 | Effective and Efficient Route Planning Using Historical Trajectories on Road Networks | 2023 | VLDB | 5.093636e-05 |
Previous
Page 1 / 1
Next
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.
Previous
Page 1 / 1
Next
Semantically Similar Papers
| # | Overall Rank | Paper | Year | Venue |
|---|---|---|---|---|
| 1 | 10,460 | High-Throughput k Nearest Neighbors Search in Road Networks | 2026 | SIGMOD |
| 2 | 3,817 | Adaptive Fastest Path Computation on a Road Network: A Traffic Mining Approach | 2007 | VLDB |
| 3 | 8,731 | Simpler is More: Efficient Top-K Nearest Neighbors Search on Large Road Networks | 2024 | VLDB |
| 4 | 5,208 | Efficient Shortest Path Counting on Large Road Networks | 2022 | VLDB |
| 5 | 5,112 | Fast Large-Scale Trajectory Clustering | 2020 | VLDB |
| 6 | 949 | Shortest Path and Distance Queries on Road Networks: An Experimental Evaluation | 2012 | VLDB |
| 7 | 10,918 | Customization Meets 2-Hop Labeling: Efficient Routing in Road Networks | 2025 | VLDB |
| 8 | 9,111 | Efficient Algorithms for Finding Optimal Meeting Point on Road Networks | 2011 | VLDB |
| 9 | 5,987 | Progressive Top-K Nearest Neighbors Search in Large Road Networks | 2020 | SIGMOD |
| 10 | 11,442 | Effective and Efficient Route Planning Using Historical Trajectories on Road Networks | 2023 | VLDB |