Efficient Route Planning on Public Transportation Networks: A Labelling Approach
Summary: TTL is a label-based index for timetable graphs, where each node stores labels for the shortest travel time to other nodes given a departure time. It supports three query types, uses preprocessing and label compression to trim space, and real-data experiments show faster queries with moderate overhead. (summarized by gpt-5-nano on Feb 09 2026)
Incoming Non-self Citations Over Time
Authors
- 1. Sibo Wang (Nanyang Technological University)
- 2. Wenqing Lin (Institute for Infocomm Research)
- 3. Yi Yang (Fudan University)
- 4. Xiaokui Xiao (Nanyang Technological University)
- 5. Shuigeng Zhou (Fudan University)
BibTeX Citation
@inproceedings{wang_sigmod15,
title = {{Efficient Route Planning on Public Transportation Networks: A Labelling Approach}},
author = {Wang, Sibo and Lin, Wenqing and Yang, Yi and Xiao, Xiaokui and Zhou, Shuigeng},
series = {{SIGMOD} '15},
booktitle = {Proceedings of the {ACM} {SIGMOD} International Conference on Management of Data},
publisher = {Association for Computing Machinery},
doi = {10.1145/2723372.2749456},
url = {https://dl.acm.org/doi/10.1145/2723372.2749456},
year = {2015}
}
Incoming Citations (Sorted by Pagerank)
Showing 15 of 15 citing papers.
Previous
Page 1 / 1
Next
Outgoing Citations (Sorted by Pagerank)
Showing 3 of 3 cited papers.
Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.
| Rank | Cited Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 197 | Fast Exact Shortest-Path Distance Queries on Large Networks by Pruned Landmark Labeling | 2013 | SIGMOD | 0.00025584127 |
| 1,105 | Path Problems in Temporal Graphs | 2014 | VLDB | 0.00011996469 |
| 2,064 | Query and Update Efficient B+-Tree Based Indexing of Moving Objects | 2004 | VLDB | 9.0942902e-05 |
Previous
Page 1 / 1
Next
Semantically Similar Papers
| # | Overall Rank | Paper | Year | Venue |
|---|---|---|---|---|
| 1 | 1,722 | Querying Shortest Paths on Time Dependent Road Networks | 2019 | VLDB |
| 2 | 4,906 | Diversified Top-k Route Planning in Road Network | 2022 | VLDB |
| 3 | 11,205 | Efficient Indexing for Flexible Label-Constrained Shortest Path Queries in Road Networks | 2025 | SIGMOD |
| 4 | 1,645 | When Hierarchy Meets 2-Hop-Labeling: Efficient Shortest Distance Queries on Road Networks | 2018 | SIGMOD |
| 5 | 1,269 | Graph Indexing of Road Networks for Shortest Path Queries with Label Restrictions | 2011 | VLDB |
| 6 | 11,311 | Customization Meets 2-Hop Labeling: Efficient Routing in Road Networks | 2025 | VLDB |
| 7 | 9,799 | Dual-Hierarchy Labelling: Scaling Up Distance Queries on Dynamic Road Networks | 2025 | SIGMOD |
| 8 | 7,377 | Efficient Label-Constrained Shortest Path Queries on Road Networks: A Tree Decomposition Approach | 2022 | VLDB |
| 9 | 10,576 | Hops Can be Constrained: Efficient Distance Queries on Large Time-Dependent Road Networks | 2026 | SIGMOD |
| 10 | 11,600 | Efficient kNN Search in Public Transportation Networks | 2024 | VLDB |