Hops Can be Constrained: Efficient Distance Queries on Large Time-Dependent Road Networks
Summary: TD-TNR-CH: a 4‑hop transit-node index for time‑dependent road networks that maps nodes to nearest transit (critical) nodes and precomputes candidate tables to answer medium/long TD‑MTTQs (short trips via TCH local search). Up to 103× faster queries and ~30 min parallel preprocessing. (summarized by gpt-5-mini on Feb 11 2026)
Incoming Non-self Citations Over Time
No non-self incoming citations found for this paper in this database.
Authors
- 1. Weihao Yu
- 2. Dian Ouyang
- 3. Fan Zhang
- 4. Xiang Zhao
- 5. Shen Su
- 6. Xuemin Lin
- 7. Zhihong Tian
Incoming Citations (Sorted by Pagerank)
Showing 0 of 0 citing papers.
| Rank | Citing Paper | Year | Venue | Pagerank |
|---|
Previous
Page 1 / 1
Next
Outgoing Citations (Sorted by Pagerank)
Showing 4 of 4 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,892 | Querying Shortest Paths on Time Dependent Road Networks | 2019 | VLDB | 0.00010185573 |
| 2,201 | When Hierarchy Meets 2-Hop-Labeling: Efficient Shortest Distance Queries on Road Networks | 2018 | SIGMOD | 9.3048105e-05 |
| 2,639 | Scaling Distance Labeling on Small-World Networks | 2019 | SIGMOD | 8.3975113e-05 |
Previous
Page 1 / 1
Next