{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,10]],"date-time":"2026-02-10T19:36:05Z","timestamp":1770752165985,"version":"3.50.0"},"publisher-location":"Cham","reference-count":18,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783319469218","type":"print"},{"value":"9783319469225","type":"electronic"}],"license":[{"start":{"date-parts":[[2016,1,1]],"date-time":"2016-01-01T00:00:00Z","timestamp":1451606400000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2016]]},"DOI":"10.1007\/978-3-319-46922-5_4","type":"book-chapter","created":{"date-parts":[[2016,9,20]],"date-time":"2016-09-20T10:40:50Z","timestamp":1474368050000},"page":"43-55","source":"Crossref","is-referenced-by-count":16,"title":["Efficient Maximum Closeness Centrality Group Identification"],"prefix":"10.1007","author":[{"given":"Chen","family":"Chen","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Wei","family":"Wang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xiaoyang","family":"Wang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2016,9,21]]},"reference":[{"key":"4_CR1","doi-asserted-by":"crossref","unstructured":"Abboud, A., Grandoni, F., Williams, V.V.: Subcubic equivalences between graph centrality problems, APSP and diameter. In: SODA, pp. 1681\u20131697 (2015)","DOI":"10.1137\/1.9781611973730.112"},{"issue":"2","key":"4_CR2","doi-asserted-by":"crossref","first-page":"245","DOI":"10.1007\/s10994-009-5103-0","volume":"75","author":"D Aloise","year":"2009","unstructured":"Aloise, D., Deshpande, A., Hansen, P., Popat, P.: NP-hardness of euclidean sum-of-squares clustering. Mach. Learn. 75(2), 245\u2013248 (2009)","journal-title":"Mach. Learn."},{"key":"4_CR3","doi-asserted-by":"crossref","unstructured":"Bavelas, A.: A mathematical model for small group structures. Hum. Organ. (1948)","DOI":"10.17730\/humo.7.3.f4033344851gl053"},{"issue":"6","key":"4_CR4","doi-asserted-by":"crossref","first-page":"726","DOI":"10.1121\/1.1906679","volume":"22","author":"A Bavelas","year":"1950","unstructured":"Bavelas, A.: Communication patterns in task oriented groups. J. Acoust. Soc. Am. 22(6), 726\u2013730 (1950)","journal-title":"J. Acoust. Soc. Am."},{"key":"4_CR5","doi-asserted-by":"crossref","first-page":"86","DOI":"10.1016\/j.socnet.2015.04.006","volume":"43","author":"P Bonacich","year":"2015","unstructured":"Bonacich, P., Lloyd, P.: Eigenvector centrality and structural zeroes and ones: when is a neighbor not a neighbor? Soc. Netw. 43, 86\u201390 (2015)","journal-title":"Soc. Netw."},{"key":"4_CR6","doi-asserted-by":"crossref","first-page":"163","DOI":"10.1080\/0022250X.2001.9990249","volume":"25","author":"U Brandes","year":"2001","unstructured":"Brandes, U.: A faster algorithm for betweenness centrality. J. Math. Sociol. 25, 163\u2013177 (2001)","journal-title":"J. Math. Sociol."},{"key":"4_CR7","unstructured":"Chechik, S., Cohen, E., Kaplan, H.: Average distance queries through weighted samples in graphs and metric spaces: high scalability with tight statistical guarantees. In: APPROX\/RANDOM (2015)"},{"key":"4_CR8","doi-asserted-by":"crossref","unstructured":"Cohen, E.: All-distances sketches, revisited: HIP estimators for massive graphs analysis. In: PODS (2014)","DOI":"10.1145\/2594538.2594546"},{"key":"4_CR9","doi-asserted-by":"crossref","unstructured":"Cohen, E., Delling, D., Pajor, T., Werneck, R.F.: Computing classic closeness centrality, at scale. In: COSN (2014)","DOI":"10.1145\/2660460.2660465"},{"key":"4_CR10","unstructured":"Eppstein, D., Wang, J.: Fast approximation of centrality. In: SODA (2001)"},{"key":"4_CR11","doi-asserted-by":"crossref","first-page":"215","DOI":"10.1016\/0378-8733(78)90021-7","volume":"1","author":"LC Freeman","year":"1978","unstructured":"Freeman, L.C.: Centrality in social networks conceptual clarification. Soc. Netw. 1, 215\u2013239 (1978)","journal-title":"Soc. Netw."},{"key":"4_CR12","doi-asserted-by":"crossref","unstructured":"Indyk, P.: Sublinear time algorithms for metric space problems. In: STOC (1999)","DOI":"10.1145\/301250.301366"},{"key":"4_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"186","DOI":"10.1007\/978-3-540-69311-6_21","volume-title":"Frontiers in Algorithmics","author":"K Okamoto","year":"2008","unstructured":"Okamoto, K., Chen, W., Li, X.-Y.: Ranking of closeness centrality for large-scale social networks. In: Preparata, F.P., Wu, X., Yin, J. (eds.) FAW 2008. LNCS, vol. 5059, pp. 186\u2013195. Springer, Heidelberg (2008)"},{"key":"4_CR14","doi-asserted-by":"crossref","unstructured":"Olsen, P.W., Labouseur, A.G., Hwang, J.: Efficient top-k closeness centrality search. In: ICDE (2014)","DOI":"10.1109\/ICDE.2014.6816651"},{"key":"4_CR15","doi-asserted-by":"crossref","unstructured":"Rattigan, M.J., Maier, M., Jensen, D.: Graph clustering with network structure indices. In: ICML, pp. 783\u2013790 (2007)","DOI":"10.1145\/1273496.1273595"},{"key":"4_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"249","DOI":"10.1007\/3-540-48224-5_21","volume-title":"Automata, Languages and Programming","author":"M Thorup","year":"2001","unstructured":"Thorup, M.: Quick k-Median, k-Center, and facility location for sparse graphs. In: Orejas, F., Spirakis, P.G., van Leeuwen, J. (eds.) ICALP 2001. LNCS, vol. 2076, p. 249. Springer, Heidelberg (2001)"},{"key":"4_CR17","doi-asserted-by":"crossref","unstructured":"Wasserman, S., Faust, K.: Social network analysis: methods and applications. Cambridge University Press, Cambridge (1994)","DOI":"10.1017\/CBO9780511815478"},{"key":"4_CR18","doi-asserted-by":"crossref","unstructured":"Zhao, J., Lui, J.C., Towsley, D., Guan, X.: Measuring and maximizing group closeness centrality over disk-resident graphs. In: WWW 2014 Companion, pp. 689\u2013694 (2014)","DOI":"10.1145\/2567948.2579356"}],"container-title":["Lecture Notes in Computer Science","Databases Theory and Applications"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-46922-5_4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,6,24]],"date-time":"2017-06-24T23:13:53Z","timestamp":1498346033000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-46922-5_4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016]]},"ISBN":["9783319469218","9783319469225"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-46922-5_4","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2016]]}}}