{"id":"https://openalex.org/W2985843284","doi":"https://doi.org/10.1109/bigdata47090.2019.9006206","title":"Local Search for Group Closeness Maximization on Big Graphs","display_name":"Local Search for Group Closeness Maximization on Big Graphs","publication_year":2019,"publication_date":"2019-12-01","ids":{"openalex":"https://openalex.org/W2985843284","doi":"https://doi.org/10.1109/bigdata47090.2019.9006206","mag":"2985843284"},"language":"en","primary_location":{"id":"doi:10.1109/bigdata47090.2019.9006206","is_oa":false,"landing_page_url":"https://doi.org/10.1109/bigdata47090.2019.9006206","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2019 IEEE International Conference on Big Data (Big Data)","raw_type":"proceedings-article"},"type":"preprint","indexed_in":["arxiv","crossref","datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://arxiv.org/pdf/1911.03360","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5077653773","display_name":"Eugenio Angriman","orcid":"https://orcid.org/0000-0002-3160-1509"},"institutions":[{"id":"https://openalex.org/I39343248","display_name":"Humboldt-Universit\u00e4t zu Berlin","ror":"https://ror.org/01hcx6992","country_code":"DE","type":"education","lineage":["https://openalex.org/I39343248"]}],"countries":["DE"],"is_corresponding":true,"raw_author_name":"Eugenio Angriman","raw_affiliation_strings":["Department of Computer Science, Humboldt-Universit\u00e4t zu, Berlin, Germany","Humboldt-Universit\u00e4t zu,Department of Computer Science,Berlin,Germany"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, Humboldt-Universit\u00e4t zu, Berlin, Germany","institution_ids":["https://openalex.org/I39343248"]},{"raw_affiliation_string":"Humboldt-Universit\u00e4t zu,Department of Computer Science,Berlin,Germany","institution_ids":["https://openalex.org/I39343248"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5060966406","display_name":"Alexander van der Grinten","orcid":"https://orcid.org/0000-0002-9709-9478"},"institutions":[{"id":"https://openalex.org/I39343248","display_name":"Humboldt-Universit\u00e4t zu Berlin","ror":"https://ror.org/01hcx6992","country_code":"DE","type":"education","lineage":["https://openalex.org/I39343248"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Alexander van der Grinten","raw_affiliation_strings":["Department of Computer Science, Humboldt-Universit\u00e4t zu, Berlin, Germany","Humboldt-Universit\u00e4t zu,Department of Computer Science,Berlin,Germany"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, Humboldt-Universit\u00e4t zu, Berlin, Germany","institution_ids":["https://openalex.org/I39343248"]},{"raw_affiliation_string":"Humboldt-Universit\u00e4t zu,Department of Computer Science,Berlin,Germany","institution_ids":["https://openalex.org/I39343248"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5020196859","display_name":"Henning Meyerhenke","orcid":"https://orcid.org/0000-0002-7769-726X"},"institutions":[{"id":"https://openalex.org/I39343248","display_name":"Humboldt-Universit\u00e4t zu Berlin","ror":"https://ror.org/01hcx6992","country_code":"DE","type":"education","lineage":["https://openalex.org/I39343248"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Henning Meyerhenke","raw_affiliation_strings":["Department of Computer Science, Humboldt-Universit\u00e4t zu, Berlin, Germany","Humboldt\u2010University of Berlin\u2028"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, Humboldt-Universit\u00e4t zu, Berlin, Germany","institution_ids":["https://openalex.org/I39343248"]},{"raw_affiliation_string":"Humboldt\u2010University of Berlin\u2028","institution_ids":["https://openalex.org/I39343248"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5077653773"],"corresponding_institution_ids":["https://openalex.org/I39343248"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":true,"cited_by_count":1,"citation_normalized_percentile":{"value":0.1276969,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":94},"biblio":{"volume":null,"issue":null,"first_page":"711","last_page":"720"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12292","display_name":"Graph Theory and Algorithms","score":0.9991999864578247,"subfield":{"id":"https://openalex.org/subfields/1707","display_name":"Computer Vision and Pattern Recognition"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T12292","display_name":"Graph Theory and Algorithms","score":0.9991999864578247,"subfield":{"id":"https://openalex.org/subfields/1707","display_name":"Computer Vision and Pattern Recognition"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9962000250816345,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10064","display_name":"Complex Network Analysis Techniques","score":0.9951000213623047,"subfield":{"id":"https://openalex.org/subfields/3109","display_name":"Statistical and Nonlinear Physics"},"field":{"id":"https://openalex.org/fields/31","display_name":"Physics and Astronomy"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/closeness","display_name":"Closeness","score":0.7326663732528687},{"id":"https://openalex.org/keywords/heuristics","display_name":"Heuristics","score":0.6556792855262756},{"id":"https://openalex.org/keywords/maximization","display_name":"Maximization","score":0.6271427273750305},{"id":"https://openalex.org/keywords/centrality","display_name":"Centrality","score":0.583096444606781},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.5514881014823914},{"id":"https://openalex.org/keywords/greedy-algorithm","display_name":"Greedy algorithm","score":0.5259675979614258},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.4768489599227905},{"id":"https://openalex.org/keywords/betweenness-centrality","display_name":"Betweenness centrality","score":0.44717124104499817},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.4124554991722107},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.40379369258880615},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.37863028049468994},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.3736972510814667},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.32596439123153687},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3130330741405487}],"concepts":[{"id":"https://openalex.org/C2779545769","wikidata":"https://www.wikidata.org/wiki/Q5135364","display_name":"Closeness","level":2,"score":0.7326663732528687},{"id":"https://openalex.org/C127705205","wikidata":"https://www.wikidata.org/wiki/Q5748245","display_name":"Heuristics","level":2,"score":0.6556792855262756},{"id":"https://openalex.org/C2776330181","wikidata":"https://www.wikidata.org/wiki/Q18358244","display_name":"Maximization","level":2,"score":0.6271427273750305},{"id":"https://openalex.org/C53811970","wikidata":"https://www.wikidata.org/wiki/Q5062194","display_name":"Centrality","level":2,"score":0.583096444606781},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.5514881014823914},{"id":"https://openalex.org/C51823790","wikidata":"https://www.wikidata.org/wiki/Q504353","display_name":"Greedy algorithm","level":2,"score":0.5259675979614258},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.4768489599227905},{"id":"https://openalex.org/C117045392","wikidata":"https://www.wikidata.org/wiki/Q4899215","display_name":"Betweenness centrality","level":3,"score":0.44717124104499817},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.4124554991722107},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.40379369258880615},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.37863028049468994},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3736972510814667},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.32596439123153687},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3130330741405487},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":4,"locations":[{"id":"doi:10.1109/bigdata47090.2019.9006206","is_oa":false,"landing_page_url":"https://doi.org/10.1109/bigdata47090.2019.9006206","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2019 IEEE International Conference on Big Data (Big Data)","raw_type":"proceedings-article"},{"id":"pmh:oai:arXiv.org:1911.03360","is_oa":true,"landing_page_url":"http://arxiv.org/abs/1911.03360","pdf_url":"https://arxiv.org/pdf/1911.03360","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"text"},{"id":"mag:2985843284","is_oa":true,"landing_page_url":"http://arxiv.org/pdf/1911.03360.pdf","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"arXiv (Cornell University)","raw_type":null},{"id":"doi:10.48550/arxiv.1911.03360","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.1911.03360","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":"article"}],"best_oa_location":{"id":"pmh:oai:arXiv.org:1911.03360","is_oa":true,"landing_page_url":"http://arxiv.org/abs/1911.03360","pdf_url":"https://arxiv.org/pdf/1911.03360","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"text"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W2985843284.pdf","grobid_xml":"https://content.openalex.org/works/W2985843284.grobid-xml"},"referenced_works_count":24,"referenced_works":["https://openalex.org/W131619556","https://openalex.org/W1482680420","https://openalex.org/W1536060130","https://openalex.org/W1965996575","https://openalex.org/W1997310799","https://openalex.org/W1999634786","https://openalex.org/W2013746780","https://openalex.org/W2046526098","https://openalex.org/W2089370556","https://openalex.org/W2107082801","https://openalex.org/W2120248756","https://openalex.org/W2134784378","https://openalex.org/W2135496605","https://openalex.org/W2147854962","https://openalex.org/W2521104974","https://openalex.org/W2609578772","https://openalex.org/W2613423694","https://openalex.org/W2954172701","https://openalex.org/W2963017687","https://openalex.org/W2963743660","https://openalex.org/W2963794747","https://openalex.org/W2976821708","https://openalex.org/W4235019172","https://openalex.org/W6737493954"],"related_works":["https://openalex.org/W3006842950","https://openalex.org/W2596938036","https://openalex.org/W2247260552","https://openalex.org/W2592759774","https://openalex.org/W3123085734","https://openalex.org/W2484873874","https://openalex.org/W2251648435","https://openalex.org/W815720198","https://openalex.org/W2769162242","https://openalex.org/W1594951361","https://openalex.org/W1973450591","https://openalex.org/W1849256610","https://openalex.org/W2565761069","https://openalex.org/W2950183326","https://openalex.org/W2585151552","https://openalex.org/W2560171979","https://openalex.org/W1946850312","https://openalex.org/W2786841533","https://openalex.org/W2963957156","https://openalex.org/W2726308634"],"abstract_inverted_index":{"In":[0],"network":[1],"analysis":[2],"and":[3,54,85,126,162,174,182,202],"graph":[4],"mining,":[5],"closeness":[6,20,33,78,111],"centrality":[7],"is":[8,37,42,49,103],"a":[9,17,45,52,104],"popular":[10],"measure":[11],"to":[12,43,63,94,117],"infer":[13],"the":[14,40,118,170,211],"importance":[15],"of":[16,31,135,137,165,189,210],"vertex.":[18],"Computing":[19],"efficiently":[21],"for":[22,58,76],"individual":[23],"vertices":[24],"received":[25],"considerable":[26],"attention.":[27],"The":[28,100],"NP-hard":[29],"problem":[30],"group":[32,47,77,105,172],"maximization,":[34],"in":[35],"turn,":[36],"more":[38,151],"challenging:":[39],"objective":[41],"find":[44],"vertex":[46],"that":[48],"central":[50],"as":[51],"whole":[53],"state-of":[55],"the-art":[56],"heuristics":[57,75],"it":[59],"do":[60],"not":[61,109],"scale":[62],"very":[64],"big":[65],"graphs":[66,132,181,201],"yet.In":[67],"this":[68],"paper,":[69],"we":[70,205],"present":[71],"new":[72,157],"local":[73,140],"search":[74,141],"maximization.":[79],"By":[80],"using":[81],"randomized":[82],"approximation":[83],"techniques":[84],"dynamic":[86],"data":[87],"structures,":[88],"our":[89,115,139,156,185],"algorithms":[90,116,142,158,186],"are":[91,159],"often":[92],"able":[93],"perform":[95],"locally":[96],"optimal":[97],"decisions":[98],"efficiently.":[99],"final":[101],"result":[102],"with":[106,133],"high":[107],"(but":[108],"optimal)":[110],"centrality.":[112],"We":[113],"compare":[114],"current":[119],"state-of-the-art":[120,212],"greedy":[121,149],"heuristic":[122],"both":[123],"on":[124,127,169,179],"weighted":[125,180],"unweighted":[128,200],"real-world":[129],"graphs.":[130],"For":[131,177,199],"hundreds":[134],"millions":[136],"edges,":[138],"take":[143],"only":[144],"around":[145],"ten":[146,153],"minutes,":[147],"while":[148,193,214],"requires":[150],"than":[152],"hours.":[154],"Overall,":[155],"between":[160],"one":[161],"two":[163],"orders":[164],"magnitude":[166],"faster,":[167],"depending":[168],"desired":[171],"size":[173],"solution":[175],"quality.":[176],"example,":[178],"k":[183,203],"=10,":[184,204],"yield":[187],"solutions":[188,207],"12.4%":[190],"higher":[191],"quality,":[192],"also":[194],"being":[195,215],"793.":[196],"6\u00d7":[197],"faster.":[198,218],"achieve":[206],"within":[208],"99.4%":[209],"quality":[213],"127.":[216],"8\u00d7":[217]},"counts_by_year":[{"year":2024,"cited_by_count":1}],"updated_date":"2026-03-27T05:58:40.876381","created_date":"2025-10-10T00:00:00"}