Database Paper Browser

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
11412
Venue
VLDB
Year
2017
Pagerank
7.4543722e-05
Overall Rank
3,164 | 77.99%
DOI
-

Incoming Non-self Citations Over Time

Authors

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