APA (7th ed.) Citation

Ohshima, T., Eumthurapojn, P., Zhao, L., & Nagamochi, H. (2011). An A Algorithm Framework for the point-to-point Time-Dependent Shortest Path Problem. Computational Geometry, Graphs and Applications, 7033, 154-163. https://doi.org/10.1007/978-3-642-24983-9_16

Chicago Style (17th ed.) Citation

Ohshima, Tatsuya, Pipaporn Eumthurapojn, Liang Zhao, and Hiroshi Nagamochi. "An A Algorithm Framework for the Point-to-point Time-Dependent Shortest Path Problem." Computational Geometry, Graphs and Applications 7033 (2011): 154-163. https://doi.org/10.1007/978-3-642-24983-9_16.

MLA (9th ed.) Citation

Ohshima, Tatsuya, et al. "An A Algorithm Framework for the Point-to-point Time-Dependent Shortest Path Problem." Computational Geometry, Graphs and Applications, vol. 7033, 2011, pp. 154-163, https://doi.org/10.1007/978-3-642-24983-9_16.