Time-aggregated graphs for modeling spatio-temporal networks

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

Volumn 4231 LNCS, Issue , 2006, Pages 85-99

  George, Betsy ^a   Shekhar, Shashi ^a  

^a University of Minnesota   (United States)

Author keywords

Location based services; Shortest paths; Spatio temporal data bases; Time aggregated graphs

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; COMPUTER NETWORKS; PROBLEM SOLVING; QUERY LANGUAGES; STORAGE ALLOCATION (COMPUTER); TIME SERIES ANALYSIS;

LOCATION BASED SERVICES; SHORTEST PATHS; SPATIO TEMPORAL DATA BASES; TIME AGGREGATED GRAPHS;

COMPUTER GRAPHICS;

EID: 33845233411     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11908883_12     Document Type: Conference Paper

References (12)

1. B.C. Dean. Algorithms for minimum-cost paths in time-dependent networks. Networks, 44, August 2004.
2. Z. Ding and R.H. Guting. Modeling temporally variable transportation networks. Proc. 16th Intl. Conf. on Database. Systems for Advanced Applications, pages 154-168, 2004.
3. R. Hall. The fastest path through a network with random time-dependent travel times. Transportation Science, 20:182-188, 1986.
4. D.E. Kaufman and R.L. Smith. Fastest paths in time-dependent networks for intelligent vehicle highway systems applications. IVHS Journal, 1(1):1-11, 1993.
5. E. Kohler, K. Langtau, and Skutella M. Time-expanded graphs for flow-dependent transit times. Proc. 10th Annual European Symposium on Algorithms, pages 599-611, 2002.
6. Q. Lu, B. George, and S. Shekhar. Capacity Constrained Routing Algorithms for Evacuation Planning: A Summary of Results. Proc. of 9th International Symposium on Spatial and Temporal Databases (SSTD'05), August 2005.
7. E. Miller-Hooks and H.S. Mahmassani. Least possible time paths in stochastic time-varying networks. Computers and Operations Research, 25(12):1107-1125, 1998.
8. E. Miller-Hooks and H.S. Mahmassani. Path comparisons for a priori and time-adaptive decisions in stochastic, time-varying networks. European Journal of Operational Research, 146:67-82, 2003.
9. S. Pallottino and M. G. Scuttella. Shortest path algorithms in tranportation models: Classical and innovative aspects. Equilibrium and Advanced transportation Modelling (Kluwer), pages 245-281, 1998.
10. Shekhar S. and Chawla S. Spatial Databases: Tour. Prentice Hall, 2003.
11. Shekhar S., Chawla S., R Vatsavai, X. Ma, and Yoo J.S. Location Based Services, Editors:Schiller, J. and Voisard, A. Morgan Kaufmann, 2004.
12. D. Sawitzki. Implicit Maximization of Flows over Time. Technical report, University of Dortmund, 2004.