A critical-time-point approach to all-start-time Lagrangian shortest paths: A summary of results

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 6849 LNCS, Issue , 2011, Pages 74-91

  Gunturi, Venkata M V ^a   Nunes, Ernesto ^a   Yang, KwangSoo ^a   Shekhar, Shashi ^a  

^a UNIVERSITY OF MINNESOTA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

AIR TRAVELS; CRITICAL TIME; LAGRANGIAN; NONSTATIONARY; OPTIMAL PATHS; PATH SET; REDUNDANT COMPUTATION; SHORTEST PATH; SPATIO-TEMPORAL;

LAGRANGE MULTIPLIERS; OPTIMIZATION; WIRELESS SENSOR NETWORKS;

GRAPH THEORY;

EID: 80052734222     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-22922-0_6     Document Type: Conference Paper

References (21)

1. Delta airlines, http://www.delta.com/
2. Google maps, http://www.maps.google.com/
3. Navteq, http://www.navteq.com/
4. Batchelor, G.K.: An introduction to fluid dynamics. Cambridge Univ. Press, Cambridge (1973)
5. Chabini, I., Lan, S.: Adaptations of the a* algorithm for the computation of fastest paths in deterministic discrete-time dynamic networks. IEEE Transactions on Intelligent Transportation Systems 3(1), 60-74 (2002)
6. Demiryurek, U., Banaei-Kashani, F., Shahabi, C.: A case for time-dependent shortest path computation in spatial networks. In: Proc. of the SIGSPATIAL Intl. Conf. on Advances in GIS, GIS 2010, pp. 474-477 (2010)
7. Deutsch, C.: Ups embraces high-tech delivery methods. NY Times (July 12, 2007), http://www.nytimes.com/2007/07/12/business/12ups.html
8. Ding, B., Yu, J.X., Qin, L.: Finding time-dependent shortest paths over large graphs. In: Proc. of the Intl. Conf. on Extending Database Technology (EDBT), pp. 205-216 (2008)
9. Evans, M.R., Yang, K., Kang, J.M., Shekhar, S.: A lagrangian approach for storage of spatio-temporal network datasets: a summary of results. In: Proc. of the SIGSPATIAL Intl. Conf. on Advances in GIS, GIS 2010, pp. 212-221 (2010)
10. Foschini, L., Hershberger, J., Suri, S.: On the complexity of time-dependent shortest paths. In: SODA. pp. 327-341 (2011)
11. George, B., Shekhar, S.: Time-aggregated graphs for modelling spatio-temporal networks. J. Semantics of Data XI, 191 (2007)
12. George, B., Shekhar, S., Kim, S.: Spatio-temporal network databases and routing algorithms. Tech. Rep. 08-039, Univ. of Minnesota - Comp. Sci. and Engg. (2008)
13. George, B., Kim, S., Shekhar, S.: Spatio-temporal network databases and routing algorithms: A summary of results. In: Papadias, D., Zhang, D., Kollios, G. (eds.) SSTD 2007. LNCS, vol. 4605, pp. 460-477. Springer, Heidelberg (2007)
14. Gunturi, V., Shekhar, S., Bhattacharya, A.: Minimum spanning tree on spatiotemporal networks. In: Bringas, P.G., Hameurlain, A., Quirchmayr, G. (eds.) DEXA 2010. LNCS, vol. 6262, pp. 149-158. Springer, Heidelberg (2010)
15. Kanoulas, E., Du, Y., Xia, T., Zhang, D.: Finding fastest paths on a road network with speed patterns. In: Proceedings of the 22nd International Conference on Data Engineering (ICDE), p. 10 (2006)
16. Kaufman, D.E., Smith, R.L.: Fastest paths in time-dependent networks for intelligent vehicle-highway systems application. I V H S Journal 1(1), 1-11 (1993)
17. Köhler, E., Langkau, K., Skutella, M.: Time-expanded graphs for flow-dependent transit times. In: Möhring, R.H., Raman, R. (eds.) ESA 2002. LNCS, vol. 2461, pp. 599-611. Springer, Heidelberg (2002)
18. Kleinberg, J., Tardos, E.: Algorithm Design. Pearson Education, London (2009)
19. Lovell, J.: Left-hand-turn elimination. NY Times (December 9, 2007), http://www.nytimes.com/2007/12/09/magazine/09left-handturn.html
20. Orda, A., Rom, R.: Shortest-path and minimum-delay algorithms in networks with time-dependent edge-length. J. ACM 37(3), 607-625 (1990)
21. Yuan, J., Zheng, Y., Zhang, C., Xie, W., Xie, X., Sun, G., Huang, Y.: T-drive: driving directions based on taxi trajectories. In: Proc. of the SIGSPATIAL Intl. Conf. on Advances in GIS, GIS 2010, pp. 99-108 (2010)