{"id":"https://openalex.org/W3011672761","doi":"https://doi.org/10.3390/a13030068","title":"Adding Edges for Maximizing Weighted Reachability","display_name":"Adding Edges for Maximizing Weighted Reachability","publication_year":2020,"publication_date":"2020-03-18","ids":{"openalex":"https://openalex.org/W3011672761","doi":"https://doi.org/10.3390/a13030068","mag":"3011672761"},"language":"en","primary_location":{"id":"doi:10.3390/a13030068","is_oa":true,"landing_page_url":"https://doi.org/10.3390/a13030068","pdf_url":"https://www.mdpi.com/1999-4893/13/3/68/pdf?version=1585224790","source":{"id":"https://openalex.org/S190629608","display_name":"Algorithms","issn_l":"1999-4893","issn":["1999-4893"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310310987","host_organization_name":"Multidisciplinary Digital Publishing Institute","host_organization_lineage":["https://openalex.org/P4310310987"],"host_organization_lineage_names":["Multidisciplinary Digital Publishing Institute"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Algorithms","raw_type":"journal-article"},"type":"article","indexed_in":["crossref","doaj"],"open_access":{"is_oa":true,"oa_status":"gold","oa_url":"https://www.mdpi.com/1999-4893/13/3/68/pdf?version=1585224790","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5060913079","display_name":"Federico Cor\u00f2","orcid":"https://orcid.org/0000-0002-7321-3467"},"institutions":[{"id":"https://openalex.org/I861853513","display_name":"Sapienza University of Rome","ror":"https://ror.org/02be6w209","country_code":"IT","type":"education","lineage":["https://openalex.org/I861853513"]}],"countries":["IT"],"is_corresponding":true,"raw_author_name":"Federico Cor\u00f2","raw_affiliation_strings":["Department of Computer Science, Sapienza University of Rome, 00161 Rome, Italy"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, Sapienza University of Rome, 00161 Rome, Italy","institution_ids":["https://openalex.org/I861853513"]}]},{"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), 67100 L\u2019Aquila, Italy","Gran Sasso Science Institute (GSSI), 67100 L'Aquila, Italy"],"affiliations":[{"raw_affiliation_string":"Gran Sasso Science Institute (GSSI), 67100 L\u2019Aquila, Italy","institution_ids":["https://openalex.org/I4210150763"]},{"raw_affiliation_string":"Gran Sasso Science Institute (GSSI), 67100 L'Aquila, Italy","institution_ids":["https://openalex.org/I4210150763"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5066308534","display_name":"Cristina M. Pinotti","orcid":"https://orcid.org/0000-0002-8674-868X"},"institutions":[{"id":"https://openalex.org/I27483092","display_name":"University of Perugia","ror":"https://ror.org/00x27da85","country_code":"IT","type":"education","lineage":["https://openalex.org/I27483092"]}],"countries":["IT"],"is_corresponding":false,"raw_author_name":"Cristina M. Pinotti","raw_affiliation_strings":["Department of Computer Science and Mathematics, University of Perugia, 06123 Perugia PG, Italy"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science and Mathematics, University of Perugia, 06123 Perugia PG, Italy","institution_ids":["https://openalex.org/I27483092"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5060913079"],"corresponding_institution_ids":["https://openalex.org/I861853513"],"apc_list":{"value":1400,"currency":"CHF","value_usd":1515},"apc_paid":{"value":1400,"currency":"CHF","value_usd":1515},"fwci":0.5629,"has_fulltext":false,"cited_by_count":7,"citation_normalized_percentile":{"value":0.71493897,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":99},"biblio":{"volume":"13","issue":"3","first_page":"68","last_page":"68"},"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.9994999766349792,"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.9994999766349792,"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/T12288","display_name":"Optimization and Search Problems","score":0.9994000196456909,"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/T10374","display_name":"Advanced Graph Theory Research","score":0.9987999796867371,"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/reachability","display_name":"Reachability","score":0.8079499006271362},{"id":"https://openalex.org/keywords/directed-acyclic-graph","display_name":"Directed acyclic graph","score":0.6735587120056152},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5341635346412659},{"id":"https://openalex.org/keywords/directed-graph","display_name":"Directed graph","score":0.5176227688789368},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.5125365257263184},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.5052083134651184},{"id":"https://openalex.org/keywords/dynamic-programming","display_name":"Dynamic programming","score":0.4776690900325775},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.4454796016216278},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.38513004779815674},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.37423622608184814},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.3341261148452759},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.2787496745586395},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.2557636797428131}],"concepts":[{"id":"https://openalex.org/C136643341","wikidata":"https://www.wikidata.org/wiki/Q1361526","display_name":"Reachability","level":2,"score":0.8079499006271362},{"id":"https://openalex.org/C74197172","wikidata":"https://www.wikidata.org/wiki/Q1195339","display_name":"Directed acyclic graph","level":2,"score":0.6735587120056152},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5341635346412659},{"id":"https://openalex.org/C146380142","wikidata":"https://www.wikidata.org/wiki/Q1137726","display_name":"Directed graph","level":2,"score":0.5176227688789368},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.5125365257263184},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.5052083134651184},{"id":"https://openalex.org/C37404715","wikidata":"https://www.wikidata.org/wiki/Q380679","display_name":"Dynamic programming","level":2,"score":0.4776690900325775},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.4454796016216278},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.38513004779815674},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.37423622608184814},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.3341261148452759},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.2787496745586395},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.2557636797428131}],"mesh":[],"locations_count":4,"locations":[{"id":"doi:10.3390/a13030068","is_oa":true,"landing_page_url":"https://doi.org/10.3390/a13030068","pdf_url":"https://www.mdpi.com/1999-4893/13/3/68/pdf?version=1585224790","source":{"id":"https://openalex.org/S190629608","display_name":"Algorithms","issn_l":"1999-4893","issn":["1999-4893"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310310987","host_organization_name":"Multidisciplinary Digital Publishing Institute","host_organization_lineage":["https://openalex.org/P4310310987"],"host_organization_lineage_names":["Multidisciplinary Digital Publishing Institute"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Algorithms","raw_type":"journal-article"},{"id":"pmh:oai:doaj.org/article:e11a4efd97a342eaa1da0ee3ce3f3fa6","is_oa":true,"landing_page_url":"https://doaj.org/article/e11a4efd97a342eaa1da0ee3ce3f3fa6","pdf_url":null,"source":{"id":"https://openalex.org/S112646816","display_name":"SHILAP Revista de lepidopterolog\u00eda","issn_l":"0300-5267","issn":["0300-5267","2340-4078"],"is_oa":true,"is_in_doaj":true,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"journal"},"license":"cc-by-sa","license_id":"https://openalex.org/licenses/cc-by-sa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Algorithms, Vol 13, Iss 3, p 68 (2020)","raw_type":"article"},{"id":"pmh:oai:mdpi.com:/1999-4893/13/3/68/","is_oa":true,"landing_page_url":"http://dx.doi.org/10.3390/a13030068","pdf_url":null,"source":{"id":"https://openalex.org/S4306400947","display_name":"MDPI (MDPI AG)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I4210097602","host_organization_name":"Multidisciplinary Digital Publishing Institute (Switzerland)","host_organization_lineage":["https://openalex.org/I4210097602"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Algorithms","raw_type":"Text"},{"id":"pmh:oai:www.research.unipd.it:11577/3476608","is_oa":true,"landing_page_url":"https://hdl.handle.net/11577/3476608","pdf_url":null,"source":{"id":"https://openalex.org/S4377196283","display_name":"Research Padua  Archive (University of Padua)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I138689650","host_organization_name":"University of Padua","host_organization_lineage":["https://openalex.org/I138689650"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"info:eu-repo/semantics/article"}],"best_oa_location":{"id":"doi:10.3390/a13030068","is_oa":true,"landing_page_url":"https://doi.org/10.3390/a13030068","pdf_url":"https://www.mdpi.com/1999-4893/13/3/68/pdf?version=1585224790","source":{"id":"https://openalex.org/S190629608","display_name":"Algorithms","issn_l":"1999-4893","issn":["1999-4893"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310310987","host_organization_name":"Multidisciplinary Digital Publishing Institute","host_organization_lineage":["https://openalex.org/P4310310987"],"host_organization_lineage_names":["Multidisciplinary Digital Publishing Institute"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Algorithms","raw_type":"journal-article"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W3011672761.pdf","grobid_xml":"https://content.openalex.org/works/W3011672761.grobid-xml"},"referenced_works_count":36,"referenced_works":["https://openalex.org/W815720198","https://openalex.org/W819274831","https://openalex.org/W1580292412","https://openalex.org/W1680189815","https://openalex.org/W1819194591","https://openalex.org/W1965950147","https://openalex.org/W1973394376","https://openalex.org/W1973522621","https://openalex.org/W2090879820","https://openalex.org/W2117925456","https://openalex.org/W2118382442","https://openalex.org/W2118914279","https://openalex.org/W2143996311","https://openalex.org/W2273525595","https://openalex.org/W2395489635","https://openalex.org/W2401697020","https://openalex.org/W2484873874","https://openalex.org/W2548497170","https://openalex.org/W2697270245","https://openalex.org/W2782343250","https://openalex.org/W2890928321","https://openalex.org/W2912105786","https://openalex.org/W2951212506","https://openalex.org/W2962700833","https://openalex.org/W2964264613","https://openalex.org/W2965397086","https://openalex.org/W2977835081","https://openalex.org/W2984368983","https://openalex.org/W2997562111","https://openalex.org/W4234462414","https://openalex.org/W4238411931","https://openalex.org/W6623166973","https://openalex.org/W6634743436","https://openalex.org/W6638351493","https://openalex.org/W6643761932","https://openalex.org/W6722312168"],"related_works":["https://openalex.org/W2146569528","https://openalex.org/W1998712144","https://openalex.org/W4287028074","https://openalex.org/W2106828717","https://openalex.org/W3191289342","https://openalex.org/W4300165677","https://openalex.org/W4297817344","https://openalex.org/W4292730466","https://openalex.org/W2372211403","https://openalex.org/W3164774158"],"abstract_inverted_index":{"In":[0],"this":[1,46,127],"paper,":[2],"we":[3,66,101,120,152],"consider":[4],"the":[5,9,16,34,38,49,60,79,114,135],"problem":[6,17,48,81,115,137],"of":[7,11,29,41,62],"improving":[8],"reachability":[10],"a":[12,19,25,106,110,130,141,172,175],"graph.":[13],"We":[14,44,55,75],"approach":[15],"from":[18],"graph":[20,35],"augmentation":[21],"perspective,":[22],"in":[23,148],"which":[24],"limited":[26],"set":[27],"size":[28],"edges":[30],"is":[31,96],"added":[32],"to":[33,36,84,103,123],"increase":[37],"overall":[39],"number":[40],"reachable":[42],"nodes.":[43],"call":[45],"new":[47],"Maximum":[50],"Connectivity":[51],"Improvement":[52],"(MCI)":[53],"problem.":[54],"first":[56],"show":[57,76],"that,":[58],"for":[59,134],"purpose":[61],"solve":[63],"solving":[64],"MCI,":[65],"can":[67],"focus":[68],"on":[69,82,138,169],"Directed":[70],"Acyclic":[71],"Graphs":[72],"(DAG)":[73],"only.":[74],"that":[77,144,158],"approximating":[78],"MCI":[80,136],"DAG":[83],"within":[85],"any":[86],"constant":[87],"factor":[88],"greater":[89],"than":[90],"1":[91,93,161,163],"\u2212":[92,162],"/":[94,164],"e":[95,165],"NP":[97,117],"-hard":[98],"even":[99],"if":[100,119],"restrict":[102,122],"graphs":[104],"with":[105,140,171],"single":[107,111,142,173,176],"source":[108,143],"or":[109,178],"sink,":[112],"and":[113],"remains":[116],"-complete":[118],"further":[121],"unitary":[124],"weights.":[125],"Finally,":[126],"paper":[128],"presents":[129],"dynamic":[131],"programming":[132],"algorithm":[133],"trees":[139],"produces":[145],"optimal":[146],"solutions":[147],"polynomial":[149],"time.":[150],"Then,":[151],"propose":[153],"two":[154,179],"polynomial-time":[155],"greedy":[156],"algorithms":[157],"guarantee":[159],"(":[160],")":[166],"-approximation":[167],"ratio":[168],"DAGs":[170],"source,":[174],"sink":[177],"sources.":[180]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2025,"cited_by_count":1},{"year":2024,"cited_by_count":1},{"year":2021,"cited_by_count":3},{"year":2020,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}