Funder
NSFC
Guangdong Provincial Natural Science Foundation
Hunan Provincial Education Department of China
Subject
Artificial Intelligence,Computer Networks and Communications,Hardware and Architecture,Theoretical Computer Science,Software
Reference40 articles.
1. T. Akiba, Y. Iwata, Y. Yoshida, Fast exact shortest-path distance queries on large networks by pruned landmark labeling, in: Proc. of the SIGMOD, 2013, pp. 349–360.
2. T. Akiba, C. Sommer, K.I. Kawarabayashi, Shortest-path queries for complex networks: exploiting low tree-width outside the core, in: Proc. of the EDBT, 2012, pp. 144–155.
3. Search-space size in contraction hierarchies;Bauer;Theoret. Comput. Sci.,2016
4. A greedy heuristic for the set-covering problem;Chvatal;Math. Oper. Res.,1979
5. Customizable point-of-interest queries in road networks;Delling;IEEE Trans. Knowl. Data Eng.,2015
Cited by
99 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献