{"id":"https://openalex.org/W7141199466","doi":"https://doi.org/10.48550/arxiv.2603.25642","title":"Advances in Exact and Approximate Group Closeness Centrality Maximization","display_name":"Advances in Exact and Approximate Group Closeness Centrality Maximization","publication_year":2026,"publication_date":"2026-03-26","ids":{"openalex":"https://openalex.org/W7141199466","doi":"https://doi.org/10.48550/arxiv.2603.25642"},"language":null,"primary_location":{"id":"doi:10.48550/arxiv.2603.25642","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2603.25642","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":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"article"},"type":"preprint","indexed_in":["datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://doi.org/10.48550/arxiv.2603.25642","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5130739822","display_name":"Christian Schulz","orcid":null},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Schulz, Christian","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5123281708","display_name":"Jakob Ternes","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Ternes, Jakob","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5120031675","display_name":"Henning Woydt","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Woydt, Henning","raw_affiliation_strings":[],"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5130739822"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.7028999924659729,"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"}},"topics":[{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.7028999924659729,"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/T12292","display_name":"Graph Theory and Algorithms","score":0.07850000262260437,"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/T10374","display_name":"Advanced Graph Theory Research","score":0.06360000371932983,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/speedup","display_name":"Speedup","score":0.7634999752044678},{"id":"https://openalex.org/keywords/centrality","display_name":"Centrality","score":0.6696000099182129},{"id":"https://openalex.org/keywords/maximization","display_name":"Maximization","score":0.6414999961853027},{"id":"https://openalex.org/keywords/greedy-algorithm","display_name":"Greedy algorithm","score":0.5637000203132629},{"id":"https://openalex.org/keywords/closeness","display_name":"Closeness","score":0.5178999900817871},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.4984000027179718},{"id":"https://openalex.org/keywords/reduction","display_name":"Reduction (mathematics)","score":0.47859999537467957},{"id":"https://openalex.org/keywords/reciprocal","display_name":"Reciprocal","score":0.46700000762939453},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.45649999380111694}],"concepts":[{"id":"https://openalex.org/C68339613","wikidata":"https://www.wikidata.org/wiki/Q1549489","display_name":"Speedup","level":2,"score":0.7634999752044678},{"id":"https://openalex.org/C53811970","wikidata":"https://www.wikidata.org/wiki/Q5062194","display_name":"Centrality","level":2,"score":0.6696000099182129},{"id":"https://openalex.org/C2776330181","wikidata":"https://www.wikidata.org/wiki/Q18358244","display_name":"Maximization","level":2,"score":0.6414999961853027},{"id":"https://openalex.org/C51823790","wikidata":"https://www.wikidata.org/wiki/Q504353","display_name":"Greedy algorithm","level":2,"score":0.5637000203132629},{"id":"https://openalex.org/C2779545769","wikidata":"https://www.wikidata.org/wiki/Q5135364","display_name":"Closeness","level":2,"score":0.5178999900817871},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.4984000027179718},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.48489999771118164},{"id":"https://openalex.org/C111335779","wikidata":"https://www.wikidata.org/wiki/Q3454686","display_name":"Reduction (mathematics)","level":2,"score":0.47859999537467957},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.47530001401901245},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.47200000286102295},{"id":"https://openalex.org/C2777742833","wikidata":"https://www.wikidata.org/wiki/Q1964083","display_name":"Reciprocal","level":2,"score":0.46700000762939453},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.45649999380111694},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.42809998989105225},{"id":"https://openalex.org/C97137487","wikidata":"https://www.wikidata.org/wiki/Q729138","display_name":"Integer (computer science)","level":2,"score":0.3968000113964081},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.37279999256134033},{"id":"https://openalex.org/C2781311116","wikidata":"https://www.wikidata.org/wiki/Q83306","display_name":"Group (periodic table)","level":2,"score":0.3472000062465668},{"id":"https://openalex.org/C41045048","wikidata":"https://www.wikidata.org/wiki/Q202843","display_name":"Linear programming","level":2,"score":0.3425999879837036},{"id":"https://openalex.org/C2779530757","wikidata":"https://www.wikidata.org/wiki/Q1207505","display_name":"Quality (philosophy)","level":2,"score":0.3391000032424927},{"id":"https://openalex.org/C2780451532","wikidata":"https://www.wikidata.org/wiki/Q759676","display_name":"Task (project management)","level":2,"score":0.3370000123977661},{"id":"https://openalex.org/C165526019","wikidata":"https://www.wikidata.org/wiki/Q942557","display_name":"Maximum cut","level":3,"score":0.33649998903274536},{"id":"https://openalex.org/C2777303404","wikidata":"https://www.wikidata.org/wiki/Q759757","display_name":"Convergence (economics)","level":2,"score":0.3262999951839447},{"id":"https://openalex.org/C56086750","wikidata":"https://www.wikidata.org/wiki/Q6042592","display_name":"Integer programming","level":2,"score":0.32499998807907104},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.2985999882221222},{"id":"https://openalex.org/C122818955","wikidata":"https://www.wikidata.org/wiki/Q1060343","display_name":"Independent set","level":3,"score":0.29820001125335693},{"id":"https://openalex.org/C93693863","wikidata":"https://www.wikidata.org/wiki/Q897659","display_name":"Branch and bound","level":2,"score":0.2694999873638153},{"id":"https://openalex.org/C177148314","wikidata":"https://www.wikidata.org/wiki/Q170084","display_name":"Generalization","level":2,"score":0.26350000500679016},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.2606000006198883},{"id":"https://openalex.org/C88230418","wikidata":"https://www.wikidata.org/wiki/Q131476","display_name":"Graph theory","level":2,"score":0.2515000104904175}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.48550/arxiv.2603.25642","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2603.25642","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":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":"article"}],"best_oa_location":{"id":"doi:10.48550/arxiv.2603.25642","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2603.25642","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":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"article"},"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/1","score":0.6461222171783447,"display_name":"No poverty"}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"In":[0,100],"the":[1,8,22,37,91,111,117,120,123,129,145],"NP-hard":[2],"\\textsc{Group":[3],"Closeness":[4],"Centrality":[5],"Maximization}":[6],"problem,":[7],"input":[9],"is":[10,24],"a":[11,17,27,137,140,157,167,190],"graph":[12],"$G":[13],"=":[14,43],"(V,E)$":[15],"and":[16,21,75,150,170,189],"positive":[18],"integer":[19],"$k$,":[20],"task":[23],"to":[25,108,127,156,166,195],"find":[26],"set":[28],"$S":[29],"\\subseteq":[30],"V$":[31],"of":[32,39,87,119,131,142,159,187,193],"size":[33,89,118],"$k$":[34],"that":[35,172],"maximizes":[36],"reciprocal":[38],"group":[40],"farness":[41],"$f(S)":[42],"\\sum_{v":[44],"\\in":[45,48],"V}":[46],"\\min_{s":[47],"S}":[49],"\\text{dist}(v,s)$.":[50],"A":[51],"widely":[52],"used":[53],"greedy":[54],"algorithm":[55,83,149,183],"with":[56,70],"previously":[57],"unknown":[58],"approximation":[59,76,179],"guarantee":[60],"may":[61],"produce":[62],"arbitrarily":[63],"poor":[64],"approximations.":[65],"To":[66],"efficiently":[67],"obtain":[68],"solutions":[69],"quality":[71],"guarantees,":[72],"known":[73],"exact":[74,82,148],"algorithms":[77],"are":[78],"revised.":[79],"The":[80,113,181],"state-of-the-art":[81],"iteratively":[84],"solves":[85],"ILPs":[86,121],"increasing":[88],"until":[90],"ILP":[92],"at":[93],"hand":[94],"can":[95,151],"represent":[96],"an":[97],"optimal":[98],"solution.":[99],"this":[101],"work,":[102],"we":[103,162],"propose":[104],"two":[105],"new":[106],"techniques":[107,165],"further":[109],"improve":[110],"algorithm.":[112],"first":[114],"technique":[115,125],"reduces":[116],"while":[122],"second":[124],"aims":[126],"minimize":[128],"number":[130],"needed":[132],"iterations.":[133],"Our":[134],"improvements":[135],"yield":[136],"speedup":[138,192],"by":[139,154],"factor":[141,158],"$3.6$":[143],"over":[144],"next":[146],"best":[147],"achieve":[152],"speedups":[153,186],"up":[155,194],"$22.3$.":[160],"Furthermore,":[161],"add":[163],"reduction":[164],"$1/5$-approximation":[168],"algorithm,":[169],"show":[171],"these":[173],"adaptations":[174],"do":[175],"not":[176],"compromise":[177],"its":[178],"guarantee.":[180],"improved":[182],"achieves":[184],"mean":[185],"$1.4$":[188],"maximum":[191],"$2.9$":[196],"times.":[197]},"counts_by_year":[],"updated_date":"2026-03-28T06:16:51.555046","created_date":"2026-03-28T00:00:00"}