{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:09:13Z","timestamp":1750306153690,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":7,"publisher":"ACM","license":[{"start":{"date-parts":[[2016,10,31]],"date-time":"2016-10-31T00:00:00Z","timestamp":1477872000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"name":"NSF of China","award":["No. 61672399,No. U1401258,No. 61502416"],"award-info":[{"award-number":["No. 61672399,No. U1401258,No. 61502416"]}]},{"name":"UMAC Research Committee","award":["MYRG105-FST13-GZG, MYRG2015-00070-FST"],"award-info":[{"award-number":["MYRG105-FST13-GZG, MYRG2015-00070-FST"]}]},{"name":"Microsoft Research Asia"},{"name":"Macau FDCT","award":["FDCT\/106\/2012\/A3, FDCT\/116\/2013\/A3"],"award-info":[{"award-number":["FDCT\/106\/2012\/A3, FDCT\/116\/2013\/A3"]}]},{"name":"National 973 Program of China","award":["No. 2015CB352400, No. 2015CB352503"],"award-info":[{"award-number":["No. 2015CB352400, No. 2015CB352503"]}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2016,10,31]]},"DOI":"10.1145\/2996913.2997009","type":"proceedings-article","created":{"date-parts":[[2016,12,22]],"date-time":"2016-12-22T21:20:29Z","timestamp":1482441629000},"page":"1-4","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":14,"title":["Mining the most influential\n            <i>k<\/i>\n            -location set from massive trajectories"],"prefix":"10.1145","author":[{"given":"Yuhong","family":"Li","sequence":"first","affiliation":[{"name":"University of Macau, Macau, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jie","family":"Bao","sequence":"additional","affiliation":[{"name":"Microsoft Research, Beijing, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yanhua","family":"Li","sequence":"additional","affiliation":[{"name":"Worcester Polytechnic Institute"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yingcai","family":"Wu","sequence":"additional","affiliation":[{"name":"Zhejiang University, Zhejiang, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Zhiguo","family":"Gong","sequence":"additional","affiliation":[{"name":"University of Macau, Macau, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yu","family":"Zheng","sequence":"additional","affiliation":[{"name":"Microsoft Research, Beijing, China and Shenzhen Institutes of Advanced Technology, Chinese Academy of Sciences, China and Xidian University, China"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2016,10,31]]},"reference":[{"key":"e_1_3_2_1_1_1","first-page":"231","volume-title":"ACM","author":"Chierichetti F.","year":"2010","unstructured":"F. Chierichetti , R. Kumar , and A. Tomkins , \" Max-cover in map-reduce,\" in WWW . ACM , 2010 , pp. 231 -- 240 . F. Chierichetti, R. Kumar, and A. Tomkins, \"Max-cover in map-reduce,\" in WWW. ACM, 2010, pp. 231--240."},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"crossref","first-page":"100","DOI":"10.1145\/780542.780558","article-title":"The online set cover problem","author":"Alon N.","year":"2003","unstructured":"N. Alon , B. Awerbuch , Y. Azar , N. Buchbinder , and J. Naor , \" The online set cover problem ,\" in STOC , 2003 , pp. 100 -- 105 . N. Alon, B. Awerbuch, Y. Azar, N. Buchbinder, and J. Naor, \"The online set cover problem,\" in STOC, 2003, pp. 100--105.","journal-title":"STOC"},{"key":"e_1_3_2_1_3_1","first-page":"697","article-title":"On maximum coverage in the streaming model & application to multi-topic blog-watch","author":"Saha B.","year":"2009","unstructured":"B. Saha and L. Getoor , \" On maximum coverage in the streaming model & application to multi-topic blog-watch ,\" in SDM , 2009 , pp. 697 -- 708 . B. Saha and L. Getoor, \"On maximum coverage in the streaming model & application to multi-topic blog-watch,\" in SDM, 2009, pp. 697--708.","journal-title":"SDM"},{"key":"e_1_3_2_1_4_1","first-page":"94","volume-title":"set cover, vertex cover, independent set, and related problems,\" in Approximation algorithms for NP-hard problems","author":"Hochbaum D. S.","year":"1996","unstructured":"D. S. Hochbaum , \"Approximating covering and packing problems : set cover, vertex cover, independent set, and related problems,\" in Approximation algorithms for NP-hard problems . PWS Publishing Co. , 1996 , pp. 94 -- 143 . D. S. Hochbaum, \"Approximating covering and packing problems: set cover, vertex cover, independent set, and related problems,\" in Approximation algorithms for NP-hard problems. PWS Publishing Co., 1996, pp. 94--143."},{"key":"e_1_3_2_1_5_1","first-page":"352","volume-title":"ACM","author":"Lou Y.","year":"2009","unstructured":"Y. Lou , C. Zhang , Y. Zheng , X. Xie , W. Wang , and Y. Huang , \" Map-matching for low-sampling-rate gps trajectories,\" in SIGSPATIAL . ACM , 2009 , pp. 352 -- 361 . Y. Lou, C. Zhang, Y. Zheng, X. Xie, W. Wang, and Y. Huang, \"Map-matching for low-sampling-rate gps trajectories,\" in SIGSPATIAL. ACM, 2009, pp. 352--361."},{"key":"e_1_3_2_1_6_1","volume-title":"The r+-tree: A dynamic index for multi-dimensional objects","author":"Sellis T.","year":"1987","unstructured":"T. Sellis , N. Roussopoulos , and C. Faloutsos , \" The r+-tree: A dynamic index for multi-dimensional objects ,\" 1987 . T. Sellis, N. Roussopoulos, and C. Faloutsos, \"The r+-tree: A dynamic index for multi-dimensional objects,\" 1987."},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/285055.285059"}],"event":{"name":"SIGSPATIAL'16: 24th ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems","acronym":"SIGSPATIAL'16","location":"Burlingame California"},"container-title":["Proceedings of the 24th ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2996913.2997009","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2996913.2997009","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T03:39:40Z","timestamp":1750217980000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2996913.2997009"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,10,31]]},"references-count":7,"alternative-id":["10.1145\/2996913.2997009","10.1145\/2996913"],"URL":"https:\/\/doi.org\/10.1145\/2996913.2997009","relation":{},"subject":[],"published":{"date-parts":[[2016,10,31]]},"assertion":[{"value":"2016-10-31","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}