AI帮你理解科学
Better Landmarks Within Reach
Workshop on Experimental and Efficient Algorithms, (2008): 38-51
EI
关键词
摘要
We present significant improvements to a practical algorithm for the point-to-point shortest path problem on road networks that com- bines Asearch, landmark-based lower bounds, and reach-based pruning. Through reach-aware landmarks, better use of cache, and improved algo- rithms for reach computation, we make preprocessing and queries fas...更多
代码:
数据:
标签
评论
数据免责声明
页面数据均来自互联网公开来源、合作出版商和通过AI技术自动分析结果,我们不对页面数据的有效性、准确性、正确性、可靠性、完整性和及时性做出任何承诺和保证。若有疑问,可以通过电子邮件方式联系我们:report@aminer.cn