Finding the cost-optimal path with time constraint over time-dependent graphs
Authors:
Open Access
- 1 May 2014
- journal article
- Published by Association for Computing Machinery (ACM) in Proceedings of the VLDB Endowment
- Vol. 7 (9) , 673-684
Abstract
No abstract availableThis publication has 20 references indexed in Scilit:
- Shortest-path queries in static networksACM Computing Surveys, 2014
- Efficient processing of distance queries in large graphs2012
- Shortest path and distance queries on road networksProceedings of the VLDB Endowment, 2012
- Relational approach for shortest path discovery over large graphsProceedings of the VLDB Endowment, 2011
- Spatio-temporal Network Databases and Routing Algorithms: A Summary of Results2007
- The London Congestion ChargeJournal of Economic Perspectives, 2006
- Shortest paths in a network with time-dependent flow speedsEuropean Journal of Operational Research, 2000
- Discrete Dynamic Shortest Path Problems in Transportation Applications: Complexity and Algorithms with Optimal Run TimeTransportation Research Record: Journal of the Transportation Research Board, 1998
- Shortest path problems with time constraintsLecture Notes in Computer Science, 1996
- Shortest-path and minimum-delay algorithms in networks with time-dependent edge-lengthJournal of the ACM, 1990