Shortest path and distance queries on road networks : an experimental evaluation
Computing the shortest path between two given locations in a road network is an important problem that finds applications in various map services and commercial navigation products. The state-of-the-art solutions for the problem can be divided into two categories: spatial-coherence-based methods and...
Saved in:
Main Authors: | Wu, Lingkun, Xiao, Xiaokui, Deng, Dingxiong, Cong, Gao, Zhou, Shuigeng, Zhu, Andy Diwen |
---|---|
其他作者: | School of Computer Engineering |
格式: | Conference or Workshop Item |
語言: | English |
出版: |
2013
|
主題: | |
在線閱讀: | https://hdl.handle.net/10356/98726 http://hdl.handle.net/10220/13439 http://dl.acm.org/citation.cfm?id=2140438 |
標簽: |
添加標簽
沒有標簽, 成為第一個標記此記錄!
|
相似書籍
-
Effective indexing for approximate constrained shortest path queries on large road networks
由: Wang, Sibo, et al.
出版: (2017) -
Efficient index structures for reachability and shortest path queries
由: Wang, Sibo
出版: (2016) -
An efficient algorithm for mapping vehicle trajectories onto road networks
由: Tang, Youze, et al.
出版: (2013) -
A machine learning-based approach to time-dependent shortest path queries
由: Wei, Yumou
出版: (2017) -
Energy-Efficient Shortest Path Query Processing on Air
由: JING, Yinan, et al.
出版: (2011)