Efficient K-Nearest Neighbor Search in Time-Dependent Spatial Networks
Authors:
- 1 January 2010
- book chapter
- Published by Springer Nature in Lecture Notes in Computer Science
- p. 432-449
Abstract
No abstract availableKeywords
This publication has 16 references indexed in Scilit:
- Towards K-Nearest Neighbor Search in Time-Dependent Spatial Network Databases2010
- Towards modeling the traffic data on road networks2009
- Finding time-dependent shortest paths over large graphs2008
- Spatio-temporal Network Databases and Routing Algorithms: A Summary of Results2007
- Fast Nearest Neighbor Search on Road Networks2006
- Finding Fastest Paths on A Road Network with Speed Patterns2006
- The Islands Approach to Nearest Neighbor Querying in Spatial Networks2005
- Shortest-path and minimum-delay algorithms in networks with time-dependent edge-lengthJournal of the ACM, 1990
- R-trees1984
- The shortest route through a network with time-dependent internodal transit timesJournal of Mathematical Analysis and Applications, 1966