Finding the Cost-Optimal Path with Time Constraint over Time-Dependent Graphs
Summary: Cost-optimal (rather than earliest-arrival) routing under time constraints in time-dependent graphs, where standard TDSP optimal-substructure assumptions fail. Proposes a novel O(kn log n + mk)-time, O((n+m)k)-space algorithm, validated experimentally. (summarized by gpt-5.6-luna on Jul 24 2026)
Incoming Non-self Citations Over Time
Authors
- 1. Yajun Yang (Tianjin University)
- 2. Hong Gao (Harbin Engineering University)
- 3. Jeffrey Xu Yu (Chinese University of Hong Kong)
- 4. Jianzhong Li (Harbin Engineering University)
BibTeX Citation
@article{yang_vldb14,
title = {{Finding the Cost-Optimal Path with Time Constraint over Time-Dependent Graphs}},
author = {Yang, Yajun and Gao, Hong and Yu, Jeffrey Xu and Li, Jianzhong},
journal = {PVLDB},
series = {{VLDB} '14},
volume = {7},
number = {9},
pages = {673--684},
doi = {10.14778/2732939.2732943},
url = {https://doi.org/10.14778/2732939.2732943},
year = {2014}
}Incoming Citations (Sorted by Pagerank)
Showing 4 of 4 citing papers.
| Rank | Citing Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 4,175 | Minimal On-Road Time Route Scheduling on Time-Dependent Graphs | 2017 | VLDB | 6.757832e-05 |
| 4,340 | Constrained Shortest Path Query in a Large Time-Dependent Graph | 2019 | VLDB | 6.6518685e-05 |
| 4,906 | Diversified Top-k Route Planning in Road Network | 2022 | VLDB | 6.3616468e-05 |
| 9,386 | Behavior Query Discovery in System-Generated Temporal Graphs | 2016 | VLDB | 5.1868213e-05 |
Previous
Page 1 / 1
Next
Outgoing Citations (Sorted by Pagerank)
Showing 6 of 6 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 |
| 953 | Shortest Path and Distance Queries on Road Networks: An Experimental Evaluation | 2012 | VLDB | 0.00012877507 |
| 1,232 | Shortest Path and Distance Queries on Road Networks: Towards Bridging Theory and Practice | 2013 | SIGMOD | 0.0001141008 |
| 3,705 | Adaptive Fastest Path Computation on a Road Network: A Traffic Mining Approach | 2007 | VLDB | 7.0834003e-05 |
| 3,934 | Efficient Processing of Distance Queries in Large Graphs: A Vertex Cover Approach | 2012 | SIGMOD | 6.9172713e-05 |
| 5,101 | Relational Approach for Shortest Path Discovery over Large Graphs | 2012 | VLDB | 6.2732849e-05 |
Previous
Page 1 / 1
Next
Semantically Similar Papers
| # | Overall Rank | Paper | Year | Venue |
|---|---|---|---|---|
| 1 | 6,200 | On Querying Historical Connectivity in Temporal Graphs | 2024 | SIGMOD |
| 2 | 6,767 | Scalable Time-Range k-Core Query on Temporal Graphs | 2023 | VLDB |
| 3 | 5,662 | Efficiently Computing k-Edge Connected Components via Graph Decomposition | 2013 | SIGMOD |
| 4 | 6,988 | An Experimental Evaluation and Guideline for Path Finding in Weighted Dynamic Network | 2021 | VLDB |
| 5 | 1,722 | Querying Shortest Paths on Time Dependent Road Networks | 2019 | VLDB |
| 6 | 11,540 | Constant-time Connectivity Querying in Dynamic Graphs | 2024 | SIGMOD |
| 7 | 5,150 | Minimum Spanning Trees in Temporal Graphs | 2015 | SIGMOD |
| 8 | 4,340 | Constrained Shortest Path Query in a Large Time-Dependent Graph | 2019 | VLDB |
| 9 | 4,175 | Minimal On-Road Time Route Scheduling on Time-Dependent Graphs | 2017 | VLDB |
| 10 | 1,105 | Path Problems in Temporal Graphs | 2014 | VLDB |