{"id":"https://openalex.org/W2592818482","doi":"https://doi.org/10.1145/3166071","title":"Improving the Betweenness Centrality of a Node by Adding Links","display_name":"Improving the Betweenness Centrality of a Node by Adding Links","publication_year":2018,"publication_date":"2018-08-22","ids":{"openalex":"https://openalex.org/W2592818482","doi":"https://doi.org/10.1145/3166071","mag":"2592818482"},"language":"en","primary_location":{"id":"doi:10.1145/3166071","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3166071","pdf_url":null,"source":{"id":"https://openalex.org/S201104086","display_name":"ACM Journal of Experimental Algorithmics","issn_l":"1084-6654","issn":["1084-6654"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"ACM Journal of Experimental Algorithmics","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5033374981","display_name":"Elisabetta Bergamini","orcid":"https://orcid.org/0000-0002-6480-0213"},"institutions":[{"id":"https://openalex.org/I102335020","display_name":"Karlsruhe Institute of Technology","ror":"https://ror.org/04t3en479","country_code":"DE","type":"education","lineage":["https://openalex.org/I102335020","https://openalex.org/I1305996414"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Elisabetta Bergamini","raw_affiliation_strings":["Karlsruhe Institute of Technology, Germany"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Karlsruhe Institute of Technology, Germany","institution_ids":["https://openalex.org/I102335020"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5012362492","display_name":"Pierluigi Crescenzi","orcid":"https://orcid.org/0000-0001-8789-3195"},"institutions":[{"id":"https://openalex.org/I45084792","display_name":"University of Florence","ror":"https://ror.org/04jr1s763","country_code":"IT","type":"education","lineage":["https://openalex.org/I45084792"]}],"countries":["IT"],"is_corresponding":false,"raw_author_name":"Pierluigi Crescenzi","raw_affiliation_strings":["University of Florence, Italy"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of Florence, Italy","institution_ids":["https://openalex.org/I45084792"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5050291532","display_name":"Gianlorenzo D\u2019Angelo","orcid":"https://orcid.org/0000-0003-0377-7037"},"institutions":[{"id":"https://openalex.org/I4210150763","display_name":"Gran Sasso Science Institute","ror":"https://ror.org/043qcb444","country_code":"IT","type":"education","lineage":["https://openalex.org/I160013858","https://openalex.org/I4210150763"]}],"countries":["IT"],"is_corresponding":false,"raw_author_name":"Gianlorenzo D'angelo","raw_affiliation_strings":["Gran Sasso Science Institute (GSSI), Italy"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Gran Sasso Science Institute (GSSI), Italy","institution_ids":["https://openalex.org/I4210150763"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5020196859","display_name":"Henning Meyerhenke","orcid":"https://orcid.org/0000-0002-7769-726X"},"institutions":[{"id":"https://openalex.org/I180923762","display_name":"University of Cologne","ror":"https://ror.org/00rcxh774","country_code":"DE","type":"education","lineage":["https://openalex.org/I180923762"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Henning Meyerhenke","raw_affiliation_strings":["Institute of Computer Science, University of Cologne, Germany"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Institute of Computer Science, University of Cologne, Germany","institution_ids":["https://openalex.org/I180923762"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5065304290","display_name":"Lorenzo Severini","orcid":"https://orcid.org/0000-0003-3987-8796"},"institutions":[{"id":"https://openalex.org/I134940468","display_name":"Institute for Scientific Interchange","ror":"https://ror.org/00te2x188","country_code":"IT","type":"facility","lineage":["https://openalex.org/I134940468"]}],"countries":["IT"],"is_corresponding":false,"raw_author_name":"Lorenzo Severini","raw_affiliation_strings":["ISI Foundation, Italy"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"ISI Foundation, Italy","institution_ids":["https://openalex.org/I134940468"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5087656897","display_name":"Yllka Velaj","orcid":"https://orcid.org/0000-0002-5734-271X"},"institutions":[{"id":"https://openalex.org/I39387349","display_name":"University of Chieti-Pescara","ror":"https://ror.org/00qjgza05","country_code":"IT","type":"education","lineage":["https://openalex.org/I39387349"]}],"countries":["IT"],"is_corresponding":false,"raw_author_name":"Yllka Velaj","raw_affiliation_strings":["University of Chieti-Pescara, Italy"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of Chieti-Pescara, Italy","institution_ids":["https://openalex.org/I39387349"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":6,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":4.2946,"has_fulltext":false,"cited_by_count":64,"citation_normalized_percentile":{"value":0.95096488,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":94,"max":99},"biblio":{"volume":"23","issue":null,"first_page":"1","last_page":"32"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10064","display_name":"Complex Network Analysis Techniques","score":0.9997000098228455,"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"}},"topics":[{"id":"https://openalex.org/T10064","display_name":"Complex Network Analysis Techniques","score":0.9997000098228455,"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"}},{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9872000217437744,"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/T10374","display_name":"Advanced Graph Theory Research","score":0.9871000051498413,"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/betweenness-centrality","display_name":"Betweenness centrality","score":0.9840161800384521},{"id":"https://openalex.org/keywords/node","display_name":"Node (physics)","score":0.6473284959793091},{"id":"https://openalex.org/keywords/centrality","display_name":"Centrality","score":0.6187359094619751},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.5611046552658081},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.5507347583770752},{"id":"https://openalex.org/keywords/ranking","display_name":"Ranking (information retrieval)","score":0.5276426672935486},{"id":"https://openalex.org/keywords/greedy-algorithm","display_name":"Greedy algorithm","score":0.48784446716308594},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.48290586471557617},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.4432372450828552},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.42835506796836853},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.4107874631881714},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.38072389364242554},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.32025301456451416},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.30786722898483276},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.20177161693572998},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.14904195070266724}],"concepts":[{"id":"https://openalex.org/C117045392","wikidata":"https://www.wikidata.org/wiki/Q4899215","display_name":"Betweenness centrality","level":3,"score":0.9840161800384521},{"id":"https://openalex.org/C62611344","wikidata":"https://www.wikidata.org/wiki/Q1062658","display_name":"Node (physics)","level":2,"score":0.6473284959793091},{"id":"https://openalex.org/C53811970","wikidata":"https://www.wikidata.org/wiki/Q5062194","display_name":"Centrality","level":2,"score":0.6187359094619751},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.5611046552658081},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.5507347583770752},{"id":"https://openalex.org/C189430467","wikidata":"https://www.wikidata.org/wiki/Q7293293","display_name":"Ranking (information retrieval)","level":2,"score":0.5276426672935486},{"id":"https://openalex.org/C51823790","wikidata":"https://www.wikidata.org/wiki/Q504353","display_name":"Greedy algorithm","level":2,"score":0.48784446716308594},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.48290586471557617},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4432372450828552},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.42835506796836853},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4107874631881714},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.38072389364242554},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.32025301456451416},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.30786722898483276},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.20177161693572998},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.14904195070266724},{"id":"https://openalex.org/C66938386","wikidata":"https://www.wikidata.org/wiki/Q633538","display_name":"Structural engineering","level":1,"score":0.0},{"id":"https://openalex.org/C127413603","wikidata":"https://www.wikidata.org/wiki/Q11023","display_name":"Engineering","level":0,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1145/3166071","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3166071","pdf_url":null,"source":{"id":"https://openalex.org/S201104086","display_name":"ACM Journal of Experimental Algorithmics","issn_l":"1084-6654","issn":["1084-6654"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"ACM Journal of Experimental Algorithmics","raw_type":"journal-article"},{"id":"pmh:oai:flore.unifi.it:2158/1141909","is_oa":false,"landing_page_url":"http://hdl.handle.net/2158/1141909","pdf_url":null,"source":{"id":"https://openalex.org/S4306402033","display_name":"Florence Research (University of Florence)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I45084792","host_organization_name":"University of Florence","host_organization_lineage":["https://openalex.org/I45084792"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"info:eu-repo/semantics/article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":60,"referenced_works":["https://openalex.org/W131619556","https://openalex.org/W141711295","https://openalex.org/W160678529","https://openalex.org/W324754135","https://openalex.org/W815720198","https://openalex.org/W1029409534","https://openalex.org/W1439932879","https://openalex.org/W1580292412","https://openalex.org/W1603540962","https://openalex.org/W1644104870","https://openalex.org/W1680189815","https://openalex.org/W1819194591","https://openalex.org/W1898824936","https://openalex.org/W1899379166","https://openalex.org/W1965950147","https://openalex.org/W1971937094","https://openalex.org/W1973394376","https://openalex.org/W1973522621","https://openalex.org/W1974057042","https://openalex.org/W1988957755","https://openalex.org/W2001741445","https://openalex.org/W2011039300","https://openalex.org/W2014732416","https://openalex.org/W2048324994","https://openalex.org/W2049354208","https://openalex.org/W2053572557","https://openalex.org/W2067674168","https://openalex.org/W2067935583","https://openalex.org/W2076572897","https://openalex.org/W2088961699","https://openalex.org/W2096423888","https://openalex.org/W2115579680","https://openalex.org/W2117925456","https://openalex.org/W2127992497","https://openalex.org/W2139148100","https://openalex.org/W2139259280","https://openalex.org/W2140581669","https://openalex.org/W2143996311","https://openalex.org/W2171707538","https://openalex.org/W2188140040","https://openalex.org/W2241780750","https://openalex.org/W2273525595","https://openalex.org/W2276989614","https://openalex.org/W2284958355","https://openalex.org/W2295412517","https://openalex.org/W2295695614","https://openalex.org/W2338639814","https://openalex.org/W2344526012","https://openalex.org/W2388242991","https://openalex.org/W2394524638","https://openalex.org/W2407891964","https://openalex.org/W2484873874","https://openalex.org/W2608205683","https://openalex.org/W2732288815","https://openalex.org/W2755088640","https://openalex.org/W2963794747","https://openalex.org/W2963957156","https://openalex.org/W3167683174","https://openalex.org/W4205585032","https://openalex.org/W4389615663"],"related_works":["https://openalex.org/W1973509935","https://openalex.org/W4389076551","https://openalex.org/W2097992793","https://openalex.org/W2107855069","https://openalex.org/W2611574733","https://openalex.org/W2241641394","https://openalex.org/W2140653560","https://openalex.org/W2348831795","https://openalex.org/W2514739320","https://openalex.org/W4312461432"],"abstract_inverted_index":{"Betweenness":[0,81],"is":[1],"a":[2,19,25,30,49,57,78,90,106,130,168,190,237,242],"well-known":[3],"centrality":[4,54],"measure":[5],"that":[6,84,98,110,155,172],"ranks":[7],"the":[8,15,34,43,70,74,87,161,165,181,196,212],"nodes":[9],"according":[10],"to":[11,64,219,229],"their":[12],"participation":[13],"in":[14,38,103,233,236],"shortest":[16],"paths":[17],"of":[18,45,60,72,77,85,89,167,183,198,208,223,239],"network.":[20],"In":[21,66],"several":[22,149,175],"scenarios,":[23],"having":[24],"high":[26],"betweenness":[27,75,162,197],"can":[28,51],"have":[29],"positive":[31],"impact":[32],"on":[33,148,225],"node":[35,170,200],"itself.":[36],"Hence,":[37],"this":[39],"article,":[40],"we":[41,68,144,187,215],"consider":[42],"problem":[44,71],"determining":[46],"how":[47],"much":[48],"vertex":[50],"increase":[52],"its":[53,146],"by":[55],"creating":[56],"limited":[58],"amount":[59],"new":[61,191],"edges":[62,232],"incident":[63],"it.":[65],"particular,":[67],"study":[69],"maximizing":[73,86],"score":[76,163],"given":[79,91,169],"node\u2014Maximum":[80,92],"Improvement":[82,94],"(MBI)\u2014and":[83],"ranking":[88,166],"Ranking":[93],"(MRI).":[95],"We":[96,127,152],"show":[97,154],"MBI":[99,136,224],"cannot":[100],"be":[101,207],"approximated":[102],"polynomial-time":[104,116],"within":[105],"factor":[107,118],"(1\u22121/2e)":[108],"and":[109,143,164,171],"MRI":[111],"does":[112],"not":[113],"admit":[114],"any":[115],"constant":[117],"approximation":[119,133,141,222],"algorithm,":[120,186,214],"both":[121,160],"unless":[122],"P":[123],"=":[124],"NP":[125],".":[126],"then":[128],"propose":[129,189],"simple":[131],"greedy":[132,185],"algorithm":[134,157,193],"for":[135,194],"with":[137,227],"an":[138,202,221],"almost":[139],"tight":[140],"ratio":[142],"test":[145],"performance":[147],"real-world":[150],"networks.":[151],"experimentally":[153],"our":[156,184],"highly":[158],"increases":[159],"it":[173],"outperforms":[174],"competitive":[176],"baselines.":[177],"To":[178],"speed":[179],"up":[180,228],"computation":[182],"also":[188],"dynamic":[192,213],"updating":[195],"one":[199],"after":[201],"edge":[203],"insertion,":[204],"which":[205],"might":[206],"independent":[209],"interest.":[210],"Using":[211],"are":[216],"now":[217],"able":[218],"compute":[220],"networks":[226],"10":[230],"5":[231],"most":[234],"cases":[235],"matter":[238],"seconds":[240],"or":[241],"few":[243],"minutes.":[244]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2025,"cited_by_count":10},{"year":2024,"cited_by_count":6},{"year":2023,"cited_by_count":11},{"year":2022,"cited_by_count":7},{"year":2021,"cited_by_count":9},{"year":2020,"cited_by_count":12},{"year":2019,"cited_by_count":6},{"year":2018,"cited_by_count":2}],"updated_date":"2026-05-21T06:26:12.895304","created_date":"2025-10-10T00:00:00"}