Luca Foschini, John Hershberger, Subhash Suri. On the Complexity of Time-Dependent Shortest Paths. In Dana Randall, editor, Proceedings of the Twenty-Second Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2011, San Francisco, California, USA, January 23-25, 2011. pages 327-341, SIAM, 2011. [doi]
@inproceedings{FoschiniHS11,
title = {On the Complexity of Time-Dependent Shortest Paths},
author = {Luca Foschini and John Hershberger and Subhash Suri},
year = {2011},
url = {http://www.siam.org/proceedings/soda/2011/SODA11_027_foschinil.pdf},
researchr = {https://researchr.org/publication/FoschiniHS11},
cites = {0},
citedby = {0},
pages = {327-341},
booktitle = {Proceedings of the Twenty-Second Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2011, San Francisco, California, USA, January 23-25, 2011},
editor = {Dana Randall},
publisher = {SIAM},
}