On the Complexity of Time-Dependent Shortest Paths - researchr publication authors

researchr

You are not signed in
Sign in
Sign up

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]

This author has not been identified. Look up 'Luca Foschini' in GoogleThis author has not been identified. Look up 'John Hershberger' in GoogleThis author has not been identified. Look up 'Subhash Suri' in Google

runs on WebDSL