Customization Meets 2-Hop Labeling: Efficient Routing in Road Networks
Summary: Customizable Tree Labeling (CTL): a 2-hop-cover labeling framework that decouples metric-independent tree-hierarchy preprocessing from fast metric customization and query execution, enabling metric-agnostic, robust routing. Parameterized hybrid customization that mixes tree labels and shortcut graphs to trade label size, customization time, and query latency, yielding much faster queries on large road networks and real-time traffic scenarios. (summarized by gpt-5-mini on Feb 09 2026)
Incoming Non-self Citations Over Time
No non-self incoming citations found for this paper in this database.
Authors
- 1. Muhammad Farhan (Australian National University)
- 2. Henning Koehler (Massey University)
- 3. Qing Wang (Australian National University)
- 4. Jiawen Wang (Australian National University)
- 5. Moritz Laupichler (Karlsruhe Institute of Technology)
- 6. Peter Sanders (Karlsruhe Institute of Technology)
BibTeX Citation
@article{farhan_vldb25,
title = {{Customization Meets 2-Hop Labeling: Efficient Routing in Road Networks}},
author = {Farhan, Muhammad and Koehler, Henning and Wang, Qing and Wang, Jiawen and Laupichler, Moritz and Sanders, Peter},
journal = {PVLDB},
series = {{VLDB} '25},
volume = {18},
number = {10},
pages = {3326--3338},
doi = {10.14778/3748191.3748198},
url = {https://doi.org/10.14778/3748191.3748198},
year = {2025}
}Incoming Citations (Sorted by Pagerank)
Showing 0 of 0 citing papers.
| Rank | Citing Paper | Year | Venue | Pagerank |
|---|
Outgoing Citations (Sorted by Pagerank)
Showing 9 of 9 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 |
|---|---|---|---|---|
| 1 | 10,379 | Hops Can be Constrained: Efficient Distance Queries on Large Time-Dependent Road Networks | 2026 | SIGMOD |
| 2 | 5,208 | Efficient Shortest Path Counting on Large Road Networks | 2022 | VLDB |
| 3 | 7,226 | Efficient Label-Constrained Shortest Path Queries on Road Networks: A Tree Decomposition Approach | 2022 | VLDB |
| 4 | 1,598 | Efficient Route Planning on Public Transportation Networks: A Labelling Approach | 2015 | SIGMOD |
| 5 | 3,817 | Adaptive Fastest Path Computation on a Road Network: A Traffic Mining Approach | 2007 | VLDB |
| 6 | 10,788 | Divide-and-Conquer: Scalable Shortest Path Counting on Large Road Networks | 2025 | SIGMOD |
| 7 | 4,807 | Diversified Top-k Route Planning in Road Network | 2022 | VLDB |
| 8 | 1,613 | When Hierarchy Meets 2-Hop-Labeling: Efficient Shortest Distance Queries on Road Networks | 2018 | SIGMOD |
| 9 | 9,619 | Dual-Hierarchy Labelling: Scaling Up Distance Queries on Dynamic Road Networks | 2025 | SIGMOD |
| 10 | 6,292 | Hierarchical Cut Labelling – Scaling Up Distance Queries on Road Networks | 2023 | SIGMOD |