Author:
Lin Qianlu,Xiao Chuan,Cheema Muhammad Aamir,Wang Wei
Publisher
Springer Berlin Heidelberg
Reference22 articles.
1. Beckmann, N., Kriegel, H.-P., Schneider, R., Seeger, B.: The r*-tree: An efficient and robust access method for points and rectangles. In: SIGMOD Conference, pp. 322–331 (1990)
2. Böhm, C., Krebs, F.: The -nearest neighbour join: Turbo charging the kdd process. Knowl. Inf. Syst. 6(6), 728–749 (2004)
3. Cabello, S., Díaz-Báñez, J.M., Langerman, S., Seara, C., Ventura, I.: Reverse facility location problems. In: CCCG, pp. 68–71 (2005)
4. Cabello, S., Díaz-Báñez, J.M., Langerman, S., Seara, C., Ventura, I.: Facility location problems in the plane based on reverse nearest neighbor queries. European Journal of Operational Research 202(1), 99–106 (2010)
5. Chaudhuri, S., Gravano, L.: Evaluating top- selection queries. In: VLDB, pp. 397–410 (1999)
Cited by
7 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Efficient Computation of the Optimal Accessible Location for a Group of Mobile Agents;ACM Transactions on Spatial Algorithms and Systems;2018-10-27
2. Optimal Meeting Points for Public Transit Users;2018 19th IEEE International Conference on Mobile Data Management (MDM);2018-06
3. Finding the optimal location and keywords in obstructed and unobstructed space;The VLDB Journal;2018-04-25
4. k-Optimal meeting points based on preferred paths;Proceedings of the 24th ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems;2016-10-31
5. Optimal mobile facility localization;Proceedings of the 23rd SIGSPATIAL International Conference on Advances in Geographic Information Systems;2015-11-03