{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,1]],"date-time":"2026-08-01T00:10:57Z","timestamp":1785543057478,"version":"3.56.0"},"publisher-location":"New York, NY, USA","reference-count":21,"publisher":"ACM","license":[{"start":{"date-parts":[[2014,4,7]],"date-time":"2014-04-07T00:00:00Z","timestamp":1396828800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/100000144","name":"Division of Computer and Network Systems","doi-asserted-by":"publisher","award":["CNS-1065133"],"award-info":[{"award-number":["CNS-1065133"]}],"id":[{"id":"10.13039\/100000144","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100006754","name":"U.S. Army Research Laboratory","doi-asserted-by":"publisher","award":["W911NF-09-2-0053"],"award-info":[{"award-number":["W911NF-09-2-0053"]}],"id":[{"id":"10.13039\/100006754","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2014,4,7]]},"DOI":"10.1145\/2567948.2579356","type":"proceedings-article","created":{"date-parts":[[2016,2,5]],"date-time":"2016-02-05T19:44:31Z","timestamp":1454701471000},"page":"689-694","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":14,"title":["Measuring and maximizing group closeness centrality over disk-resident graphs"],"prefix":"10.1145","author":[{"given":"Junzhou","family":"Zhao","sequence":"first","affiliation":[{"name":"Xi'an Jiaotong University, Xi'an, China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"John C.S.","family":"Lui","sequence":"additional","affiliation":[{"name":"The Chinese University of Hong Kong, Hong Kong, China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Don","family":"Towsley","sequence":"additional","affiliation":[{"name":"University of Massachusetts Amherst, Amherst, MA, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Xiaohong","family":"Guan","sequence":"additional","affiliation":[{"name":"Xi'an Jiaotong University, Xi'an, China"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2014,4,7]]},"reference":[{"key":"e_1_3_2_1_1_1","unstructured":"Technique report. http:\/\/nskeylab.xjtu.edu.cn\/dataset\/jzzhao\/NodeGroup_TR.pdf 2013.  _______________. Technique report. http:\/\/nskeylab.xjtu.edu.cn\/dataset\/jzzhao\/NodeGroup_TR.pdf 2013."},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0022-0000(05)80068-6"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/1772690.1772715"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/1871437.1871501"},{"key":"e_1_3_2_1_5_1","volume-title":"OSDI","author":"Dean J.","year":"2004","unstructured":"J. Dean and S. Ghemawat . MapReduce: Simplified data processing on large clusters . In OSDI , 2004 . J. Dean and S. Ghemawat. MapReduce: Simplified data processing on large clusters. In OSDI, 2004."},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.7155\/jgaa.00081"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1080\/0022250X.1999.9990219"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1016\/0022-0000(85)90041-8"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/28869.28874"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1016\/0378-8733(78)90021-7"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/321992.321993"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611972818.11"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/1772690.1772751"},{"key":"e_1_3_2_1_14_1","volume-title":"OSDI","author":"Kyrola A.","year":"2012","unstructured":"A. Kyrola , G. Blelloch , and C. Guestrin . GraphChi: Large-scale graph computation on just a PC . In OSDI , 2012 . A. Kyrola, G. Blelloch, and C. Guestrin. GraphChi: Large-scale graph computation on just a PC. In OSDI, 2012."},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-13657-3_12"},{"key":"e_1_3_2_1_16_1","first-page":"14","article-title":"An analysis of approximations for maximizing submodular set functions","author":"Nemhauser G.","year":"1978","unstructured":"G. Nemhauser , L. Wolsey , and M. Fisher . An analysis of approximations for maximizing submodular set functions . Math. Prog. , 14 , 1978 . G. Nemhauser, L. Wolsey, and M. Fisher. An analysis of approximations for maximizing submodular set functions. Math. Prog., 14, 1978.","journal-title":"Math. Prog."},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-69311-6_21"},{"key":"e_1_3_2_1_18_1","volume-title":"Workshop on Information Networks","author":"Oktay H.","year":"2011","unstructured":"H. Oktay , A. S. Balkir , I. Foster , and D. D. Jensen . Distance estimation for very large networks using mapreduce and network structure indices . In Workshop on Information Networks , 2011 . H. Oktay, A. S. Balkir, I. Foster, and D. D. Jensen. Distance estimation for very large networks using mapreduce and network structure indices. In Workshop on Information Networks, 2011."},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1145\/775047.775059"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1109\/CLUSTER.2013.6702680"},{"key":"e_1_3_2_1_21_1","volume-title":"IEEE NSW","author":"Lim Y.","year":"2011","unstructured":"Y. sup Lim , B. Ribeiro , D. S. Menasche , P. Basu , and D. Towsley . Online estimating the top k nodes of a network . In IEEE NSW , 2011 . Y. sup Lim, B. Ribeiro, D. S. Menasche, P. Basu, and D. Towsley. Online estimating the top k nodes of a network. In IEEE NSW, 2011."}],"event":{"name":"WWW '14: 23rd International World Wide Web Conference","location":"Seoul Korea","acronym":"WWW '14","sponsor":["IW3C2 International World Wide Web Conference Committee","SIGWEB ACM Special Interest Group on Hypertext, Hypermedia, and Web"]},"container-title":["Proceedings of the 23rd International Conference on World Wide Web"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2567948.2579356","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2567948.2579356","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T08:10:31Z","timestamp":1750234231000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2567948.2579356"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,4,7]]},"references-count":21,"alternative-id":["10.1145\/2567948.2579356","10.1145\/2567948"],"URL":"https:\/\/doi.org\/10.1145\/2567948.2579356","relation":{},"subject":[],"published":{"date-parts":[[2014,4,7]]},"assertion":[{"value":"2014-04-07","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}