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)

Paper ID: 13963
Venue: VLDB
Year: 2025
Pagerank: 4.1945683e-05
Overall Rank: 10,669 | 25.78%
DOI: 10.14778/3748191.3748198

Incoming Non-self Citations Over Time

No non-self incoming citations found for this paper in this database.

Authors

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.

Rank	Cited Paper	Year	Venue	Pagerank
1,170	Shortest Path and Distance Queries on Road Networks: An Experimental Evaluation	2012	VLDB	0.00013511856
1,378	A Highway-Centric Labeling Approach for Answering Distance Queries on Large Sparse Graphs	2012	SIGMOD	0.00012294512
2,201	When Hierarchy Meets 2-Hop-Labeling: Efficient Shortest Distance Queries on Road Networks	2018	SIGMOD	9.3048105e-05
2,547	Efficient Shortest Path Index Maintenance on Dynamic Road Networks with Theoretical Guarantees	2020	VLDB	8.5683079e-05
3,342	P2H: Efficient Distance Querying on Road Networks by Projected Vertex Separators	2021	SIGMOD	7.197276e-05
4,193	Relative Subboundedness of Contraction Hierarchy and Hierarchical 2-Hop Index in Dynamic Road Networks	2022	SIGMOD	6.37019e-05
5,597	Efficient Shortest Path Counting on Large Road Networks	2022	VLDB	5.4178241e-05
6,594	Hierarchical Cut Labelling – Scaling Up Distance Queries on Road Networks	2023	SIGMOD	4.999751e-05
9,470	Dual-Hierarchy Labelling: Scaling Up Distance Queries on Dynamic Road Networks	2025	SIGMOD	4.3341665e-05

Semantically Similar Papers

Overall Rank	Paper	Year	Venue	Pagerank
10,088	Hops Can be Constrained: Efficient Distance Queries on Large Time-Dependent Road Networks	2026	SIGMOD	4.1945683e-05
5,597	Efficient Shortest Path Counting on Large Road Networks	2022	VLDB	5.4178241e-05
7,444	Efficient Label-Constrained Shortest Path Queries on Road Networks: A Tree Decomposition Approach	2022	VLDB	4.7281454e-05
1,555	Efficient Route Planning on Public Transportation Networks: A Labelling Approach	2015	SIGMOD	0.00011395261
3,699	Adaptive Fastest Path Computation on a Road Network: A Traffic Mining Approach	2007	VLDB	6.8337468e-05
10,515	Divide-and-Conquer: Scalable Shortest Path Counting on Large Road Networks	2025	SIGMOD	4.1945683e-05
4,621	Diversified Top-k Route Planning in Road Network	2022	VLDB	6.0426586e-05
2,201	When Hierarchy Meets 2-Hop-Labeling: Efficient Shortest Distance Queries on Road Networks	2018	SIGMOD	9.3048105e-05
9,470	Dual-Hierarchy Labelling: Scaling Up Distance Queries on Dynamic Road Networks	2025	SIGMOD	4.3341665e-05
6,594	Hierarchical Cut Labelling – Scaling Up Distance Queries on Road Networks	2023	SIGMOD	4.999751e-05