Public Transport Planning: When Transit Network Connectivity Meets Commuting Demand
Summary: Jointly optimize commuting demand and transit connectivity for bus-route expansion with no new stops; NP-hard, solved by expansion-based greedy. Connectivity estimated with matrix-trace Lanczos; upper-bound pruning; validated on NYC/Chicago networks. (summarized by gpt-5-nano on Feb 09 2026)
Incoming Non-self Citations Over Time
Authors
- 1. Sheng Wang (New York University)
- 2. Yuan Sun (Monash University)
- 3. Christopher Musco (New York University)
- 4. Zhifeng Bao (Royal Melbourne Institute of Technology)
BibTeX Citation
@inproceedings{wang_sigmod21,
title = {{Public Transport Planning: When Transit Network Connectivity Meets Commuting Demand}},
author = {Wang, Sheng and Sun, Yuan and Musco, Christopher and Bao, Zhifeng},
series = {{SIGMOD} '21},
booktitle = {Proceedings of the {ACM} {SIGMOD} International Conference on Management of Data},
publisher = {Association for Computing Machinery},
doi = {10.1145/3448016.3457247},
url = {https://dl.acm.org/doi/10.1145/3448016.3457247},
year = {2021}
}Incoming Citations (Sorted by Pagerank)
Showing 2 of 2 citing papers.
| Rank | Citing Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 11,272 | Efficient kNN Search in Public Transportation Networks | 2024 | VLDB | 5.093636e-05 |
| 11,347 | Expanding Reverse Nearest Neighbors | 2024 | VLDB | 5.093636e-05 |
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 |
|---|---|---|---|---|
| 1,598 | Efficient Route Planning on Public Transportation Networks: A Labelling Approach | 2015 | SIGMOD | 0.00010242826 |
| 5,112 | Fast Large-Scale Trajectory Clustering | 2020 | VLDB | 6.3596697e-05 |
| 6,472 | PPQ-Trajectory: Spatio-temporal Quantization for Querying in Large Trajectory Repositories | 2021 | VLDB | 5.8700652e-05 |
| 7,283 | Demand-Aware Route Planning for Shared Mobility Services | 2020 | VLDB | 5.6567657e-05 |
Previous
Page 1 / 1
Next
Semantically Similar Papers
| # | Overall Rank | Paper | Year | Venue |
|---|---|---|---|---|
| 1 | 6,829 | Utility-Aware Ridesharing on Road Networks | 2017 | SIGMOD |
| 2 | 3,612 | Relative Subboundedness of Contraction Hierarchy and Hierarchical 2-Hop Index in Dynamic Road Networks | 2022 | SIGMOD |
| 3 | 10,379 | Hops Can be Constrained: Efficient Distance Queries on Large Time-Dependent Road Networks | 2026 | SIGMOD |
| 4 | 9,111 | Efficient Algorithms for Finding Optimal Meeting Point on Road Networks | 2011 | VLDB |
| 5 | 4,807 | Diversified Top-k Route Planning in Road Network | 2022 | VLDB |
| 6 | 1,035 | Large Scale Real-time Ridesharing with Service Guarantee on Road Networks | 2014 | VLDB |
| 7 | 2,945 | A Unified Approach to Route Planning for Shared Mobility | 2018 | VLDB |
| 8 | 4,498 | Constrained Shortest Path Query in a Large Time-Dependent Graph | 2019 | VLDB |
| 9 | 7,283 | Demand-Aware Route Planning for Shared Mobility Services | 2020 | VLDB |
| 10 | 1,598 | Efficient Route Planning on Public Transportation Networks: A Labelling Approach | 2015 | SIGMOD |