{"id":"https://openalex.org/W2899638111","doi":"https://doi.org/10.1609/aaai.v33i01.3301501","title":"Coverage Centrality Maximization in Undirected Networks","display_name":"Coverage Centrality Maximization in Undirected Networks","publication_year":2019,"publication_date":"2019-07-17","ids":{"openalex":"https://openalex.org/W2899638111","doi":"https://doi.org/10.1609/aaai.v33i01.3301501","mag":"2899638111"},"language":"en","primary_location":{"id":"doi:10.1609/aaai.v33i01.3301501","is_oa":true,"landing_page_url":"https://doi.org/10.1609/aaai.v33i01.3301501","pdf_url":"https://aaai.org/ojs/index.php/AAAI/article/download/3823/3701","source":{"id":"https://openalex.org/S4210191458","display_name":"Proceedings of the AAAI Conference on Artificial Intelligence","issn_l":"2159-5399","issn":["2159-5399","2374-3468"],"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/P4310320058","host_organization_name":"Association for the Advancement of Artificial Intelligence","host_organization_lineage":["https://openalex.org/P4310320058"],"host_organization_lineage_names":["Association for the Advancement of Artificial Intelligence"],"type":"conference"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the AAAI Conference on Artificial Intelligence","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"diamond","oa_url":"https://aaai.org/ojs/index.php/AAAI/article/download/3823/3701","any_repository_has_fulltext":null},"authorships":[{"author_position":"first","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":true,"raw_author_name":"Gianlorenzo D\u2019Angelo","raw_affiliation_strings":["Gran Sasso Science Institute"],"affiliations":[{"raw_affiliation_string":"Gran Sasso Science Institute","institution_ids":["https://openalex.org/I4210150763"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5011938659","display_name":"Martin Olsen","orcid":"https://orcid.org/0000-0002-2740-545X"},"institutions":[{"id":"https://openalex.org/I204337017","display_name":"Aarhus University","ror":"https://ror.org/01aj84f44","country_code":"DK","type":"education","lineage":["https://openalex.org/I204337017"]}],"countries":["DK"],"is_corresponding":false,"raw_author_name":"Martin Olsen","raw_affiliation_strings":["Aarhus University"],"affiliations":[{"raw_affiliation_string":"Aarhus University","institution_ids":["https://openalex.org/I204337017"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5065304290","display_name":"Lorenzo Severini","orcid":"https://orcid.org/0000-0003-3987-8796"},"institutions":[{"id":"https://openalex.org/I4210132770","display_name":"ISI Foundation","ror":"https://ror.org/03ebhsy64","country_code":"US","type":"other","lineage":["https://openalex.org/I4210132770"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Lorenzo Severini","raw_affiliation_strings":["ISI Foundation"],"affiliations":[{"raw_affiliation_string":"ISI Foundation","institution_ids":["https://openalex.org/I4210132770"]}]}],"institutions":[],"countries_distinct_count":3,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5050291532"],"corresponding_institution_ids":["https://openalex.org/I4210150763"],"apc_list":null,"apc_paid":null,"fwci":4.0991,"has_fulltext":true,"cited_by_count":22,"citation_normalized_percentile":{"value":0.93633952,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":98},"biblio":{"volume":"33","issue":"01","first_page":"501","last_page":"508"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10064","display_name":"Complex Network Analysis Techniques","score":0.9983000159263611,"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.9983000159263611,"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/T10796","display_name":"Cooperative Communication and Network Coding","score":0.991100013256073,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"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.9905999898910522,"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/centrality","display_name":"Centrality","score":0.9652436971664429},{"id":"https://openalex.org/keywords/submodular-set-function","display_name":"Submodular set function","score":0.6887946128845215},{"id":"https://openalex.org/keywords/maximization","display_name":"Maximization","score":0.6708047986030579},{"id":"https://openalex.org/keywords/metric","display_name":"Metric (unit)","score":0.6216635704040527},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5518234968185425},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.5402846336364746},{"id":"https://openalex.org/keywords/betweenness-centrality","display_name":"Betweenness centrality","score":0.5187049508094788},{"id":"https://openalex.org/keywords/greedy-algorithm","display_name":"Greedy algorithm","score":0.5136098861694336},{"id":"https://openalex.org/keywords/network-science","display_name":"Network science","score":0.4967382550239563},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.44460126757621765},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.3789094388484955},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.31806841492652893},{"id":"https://openalex.org/keywords/complex-network","display_name":"Complex network","score":0.2752864956855774},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.2687535881996155},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.23093414306640625}],"concepts":[{"id":"https://openalex.org/C53811970","wikidata":"https://www.wikidata.org/wiki/Q5062194","display_name":"Centrality","level":2,"score":0.9652436971664429},{"id":"https://openalex.org/C178621042","wikidata":"https://www.wikidata.org/wiki/Q7631710","display_name":"Submodular set function","level":2,"score":0.6887946128845215},{"id":"https://openalex.org/C2776330181","wikidata":"https://www.wikidata.org/wiki/Q18358244","display_name":"Maximization","level":2,"score":0.6708047986030579},{"id":"https://openalex.org/C176217482","wikidata":"https://www.wikidata.org/wiki/Q860554","display_name":"Metric (unit)","level":2,"score":0.6216635704040527},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5518234968185425},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.5402846336364746},{"id":"https://openalex.org/C117045392","wikidata":"https://www.wikidata.org/wiki/Q4899215","display_name":"Betweenness centrality","level":3,"score":0.5187049508094788},{"id":"https://openalex.org/C51823790","wikidata":"https://www.wikidata.org/wiki/Q504353","display_name":"Greedy algorithm","level":2,"score":0.5136098861694336},{"id":"https://openalex.org/C137753397","wikidata":"https://www.wikidata.org/wiki/Q2434424","display_name":"Network science","level":3,"score":0.4967382550239563},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.44460126757621765},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3789094388484955},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.31806841492652893},{"id":"https://openalex.org/C34947359","wikidata":"https://www.wikidata.org/wiki/Q665189","display_name":"Complex network","level":2,"score":0.2752864956855774},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.2687535881996155},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.23093414306640625},{"id":"https://openalex.org/C162324750","wikidata":"https://www.wikidata.org/wiki/Q8134","display_name":"Economics","level":0,"score":0.0},{"id":"https://openalex.org/C136764020","wikidata":"https://www.wikidata.org/wiki/Q466","display_name":"World Wide Web","level":1,"score":0.0},{"id":"https://openalex.org/C21547014","wikidata":"https://www.wikidata.org/wiki/Q1423657","display_name":"Operations management","level":1,"score":0.0}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1609/aaai.v33i01.3301501","is_oa":true,"landing_page_url":"https://doi.org/10.1609/aaai.v33i01.3301501","pdf_url":"https://aaai.org/ojs/index.php/AAAI/article/download/3823/3701","source":{"id":"https://openalex.org/S4210191458","display_name":"Proceedings of the AAAI Conference on Artificial Intelligence","issn_l":"2159-5399","issn":["2159-5399","2374-3468"],"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/P4310320058","host_organization_name":"Association for the Advancement of Artificial Intelligence","host_organization_lineage":["https://openalex.org/P4310320058"],"host_organization_lineage_names":["Association for the Advancement of Artificial Intelligence"],"type":"conference"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the AAAI Conference on Artificial Intelligence","raw_type":"journal-article"},{"id":"pmh:oai:pure.atira.dk:publications/2c9194c7-3250-4c99-8506-47f0060fda26","is_oa":true,"landing_page_url":"https://aaai.org/ojs/index.php/AAAI/article/view/3823","pdf_url":"https://ojs.aaai.org/index.php/AAAI/article/download/3823/3701","source":null,"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Severini , L, Olsen, M & D'Angelo, G 2019, 'Coverage Centrality Maximization in Undirected Networks', Proceedings of the AAAI Conference on Artificial Intelligence, vol. 33, no. 1, pp. 501-508. https://doi.org/10.1609/aaai.v33i01.3301501","raw_type":"info:eu-repo/semantics/publishedVersion"},{"id":"pmh:oai:pure.atira.dk:openaire/2c9194c7-3250-4c99-8506-47f0060fda26","is_oa":true,"landing_page_url":"https://pure.au.dk/portal/en/publications/2c9194c7-3250-4c99-8506-47f0060fda26","pdf_url":null,"source":null,"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Severini , L, Olsen, M & D'Angelo, G 2019, 'Coverage Centrality Maximization in Undirected Networks', Proceedings of the AAAI Conference on Artificial Intelligence, vol. 33, no. 1, pp. 501-508. https://doi.org/10.1609/aaai.v33i01.3301501","raw_type":"info:eu-repo/semantics/publishedVersion"}],"best_oa_location":{"id":"doi:10.1609/aaai.v33i01.3301501","is_oa":true,"landing_page_url":"https://doi.org/10.1609/aaai.v33i01.3301501","pdf_url":"https://aaai.org/ojs/index.php/AAAI/article/download/3823/3701","source":{"id":"https://openalex.org/S4210191458","display_name":"Proceedings of the AAAI Conference on Artificial Intelligence","issn_l":"2159-5399","issn":["2159-5399","2374-3468"],"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/P4310320058","host_organization_name":"Association for the Advancement of Artificial Intelligence","host_organization_lineage":["https://openalex.org/P4310320058"],"host_organization_lineage_names":["Association for the Advancement of Artificial Intelligence"],"type":"conference"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the AAAI Conference on Artificial Intelligence","raw_type":"journal-article"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W2899638111.pdf","grobid_xml":"https://content.openalex.org/works/W2899638111.grobid-xml"},"referenced_works_count":30,"referenced_works":["https://openalex.org/W1580292412","https://openalex.org/W1680189815","https://openalex.org/W1965950147","https://openalex.org/W1997698259","https://openalex.org/W2008620264","https://openalex.org/W2019404063","https://openalex.org/W2044881936","https://openalex.org/W2067935583","https://openalex.org/W2112556110","https://openalex.org/W2117925456","https://openalex.org/W2137109654","https://openalex.org/W2140581669","https://openalex.org/W2150636758","https://openalex.org/W2273525595","https://openalex.org/W2338639814","https://openalex.org/W2484873874","https://openalex.org/W2552383377","https://openalex.org/W2592818482","https://openalex.org/W2797022269","https://openalex.org/W2802038099","https://openalex.org/W2899638111","https://openalex.org/W2952763838","https://openalex.org/W2964223707","https://openalex.org/W4237078129","https://openalex.org/W4297822441","https://openalex.org/W6636952721","https://openalex.org/W6639136306","https://openalex.org/W6641531190","https://openalex.org/W6652609139","https://openalex.org/W6680754066"],"related_works":["https://openalex.org/W2402949237","https://openalex.org/W2594118609","https://openalex.org/W2950365512","https://openalex.org/W2765425000","https://openalex.org/W4389478405","https://openalex.org/W2735578456","https://openalex.org/W1608444752","https://openalex.org/W2944632132","https://openalex.org/W2901206941","https://openalex.org/W3204684126"],"abstract_inverted_index":{"Centrality":[0],"metrics":[1,128],"are":[2,28,99,132,262],"among":[3],"the":[4,24,36,39,44,62,80,93,97,130,138,148,155,169,188,192,206,236,266],"main":[5],"tools":[6],"in":[7,67,75,96,142],"social":[8],"network":[9,18,48,56],"analysis.":[10],"Being":[11],"central":[12,26],"for":[13,123,145],"a":[14,17,47,55,58,77,104,175,198],"user":[15,49,60],"of":[16,42,46,82,92,147,208,230,249],"leads":[19],"to":[20,23,73,87,114,265],"several":[21,124,160],"benefits":[22],"user:":[25],"users":[27],"highly":[29],"influential":[30],"and":[31,57,110,162,217],"play":[32],"key":[33],"roles":[34],"within":[35,174,197],"network.":[37],"Therefore,":[38],"optimization":[40],"problem":[41,65,141,170,193],"increasing":[43],"centrality":[45,63,81,89,106,127,139,153],"recently":[50],"received":[51],"considerable":[52],"attention.":[53],"Given":[54],"target":[59],"v,":[61],"maximization":[64,140],"consists":[66],"creating":[68],"k":[69],"new":[70],"links":[71,131],"incident":[72],"v":[74,83],"such":[76],"way":[78],"that":[79,103,168,256,261],"is":[84,108,205],"maximized,":[85],"according":[86],"some":[88],"metric.":[90],"Most":[91],"algorithms":[94],"proposed":[95],"literature":[98],"based":[100,126,152],"on":[101],"showing":[102],"given":[105],"metric":[107],"monotone":[109],"submodular":[111],"with":[112,243],"respect":[113],"link":[115],"addition.":[116],"However,":[117],"this":[118,134],"property":[119],"does":[120],"not":[121],"hold":[122],"shortest-path":[125],"if":[129],"undirected.In":[133],"paper":[135],"we":[136],"study":[137],"undirected":[143],"networks":[144],"one":[146],"most":[149],"important":[150],"shortestpath":[151],"measures,":[154],"coverage":[156],"centrality.":[157],"We":[158,165,210,233,254],"provide":[159],"hardness":[161],"approximation":[163,215,228,241],"results.":[164],"first":[166],"show":[167,218,255],"cannot":[171,194],"be":[172,195],"approximated":[173,196],"factor":[176,199,229],"greater":[177],"than":[178,201],"1":[179],"\u2212":[180],"1/e,":[181],"unless":[182],"P":[183],"=":[184],"NP,":[185],"and,":[186],"under":[187],"stronger":[189],"gap-ETH":[190],"hypothesis,":[191],"better":[200],"1/no(1),":[202],"where":[203],"n":[204],"number":[207],"users.":[209],"then":[211],"propose":[212],"two":[213],"greedy":[214],"algorithms,":[216],"that,":[219],"by":[220,239,247],"suitably":[221],"combining":[222],"them,":[223],"we\u221a":[224],"can":[225],"guarantee":[226],"an":[227,250],"\u2126(1/":[231],"n).":[232],"experimentally":[234],"compare":[235],"solutions":[237,245,260],"provided":[238],"our":[240,257],"algorithm":[242,258],"optimal":[244],"computed":[246],"means":[248],"exact":[251],"IP":[252],"formulation.":[253],"produces":[259],"very":[263],"close":[264],"optimum.":[267]},"counts_by_year":[{"year":2025,"cited_by_count":2},{"year":2024,"cited_by_count":5},{"year":2023,"cited_by_count":1},{"year":2022,"cited_by_count":3},{"year":2021,"cited_by_count":4},{"year":2020,"cited_by_count":6},{"year":2019,"cited_by_count":1}],"updated_date":"2026-03-12T08:34:05.389933","created_date":"2018-11-16T00:00:00"}
