DBScholar

Back to papers

Minimal On-Road Time Route Scheduling on Time-Dependent Graphs

Summary: Enables minimal on-road time routing on time-dependent graphs by waiting at parking vertices, breaking FIFO. Gives two algorithms via a minimum on-road cost; evaluations on real graphs show improved accuracy and speed, with parking cutting on-road time. (summarized by gpt-5-nano on Feb 09 2026)

Paper ID
11600
Venue
VLDB
Year
2017
Pagerank
6.8814581e-05
Overall Rank
4,135 | 71.64%
DOI
10.14778/3137628.3137636

Incoming Non-self Citations Over Time

Authors

BibTeX Citation

@article{li_vldb17,
        title = {{Minimal On-Road Time Route Scheduling on Time-Dependent Graphs}},
        author = {Li, Lei and Hua, Wen and Du, Xingzhong and Zhou, Xiaofang},
        journal = {PVLDB},
        series = {{VLDB} '17},
        volume = {10},
        number = {11},
        pages = {1274--1287},
        doi = {10.14778/3137628.3137636},
        url = {https://doi.org/10.14778/3137628.3137636},
        year = {2017}
}

Incoming Citations (Sorted by Pagerank)

Showing 6 of 6 citing papers.

Previous Page 1 / 1 Next

Outgoing Citations (Sorted by Pagerank)

Showing 5 of 5 cited papers.

Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.

Previous Page 1 / 1 Next

Semantically Similar Papers