{"id":"https://openalex.org/W7140044751","doi":"https://doi.org/10.7155/jgaa.v30i1.3192","title":"On the Non-Submodularity of the Problem of Adding Links to Minimize the Effective Graph Resistance","display_name":"On the Non-Submodularity of the Problem of Adding Links to Minimize the Effective Graph Resistance","publication_year":2026,"publication_date":"2026-03-21","ids":{"openalex":"https://openalex.org/W7140044751","doi":"https://doi.org/10.7155/jgaa.v30i1.3192"},"language":null,"primary_location":{"id":"doi:10.7155/jgaa.v30i1.3192","is_oa":true,"landing_page_url":"https://doi.org/10.7155/jgaa.v30i1.3192","pdf_url":"https://jgaa.info/index.php/jgaa/article/download/3192/3021","source":{"id":"https://openalex.org/S33451491","display_name":"Journal of Graph Algorithms and Applications","issn_l":"1526-1719","issn":["1526-1719"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal of Graph Algorithms and Applications","raw_type":"journal-article"},"type":"article","indexed_in":["crossref","doaj"],"open_access":{"is_oa":true,"oa_status":"diamond","oa_url":"https://jgaa.info/index.php/jgaa/article/download/3192/3021","any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5073262194","display_name":"Massimo A. Achterberg","orcid":"https://orcid.org/0000-0002-9469-1732"},"institutions":[{"id":"https://openalex.org/I98358874","display_name":"Delft University of Technology","ror":"https://ror.org/02e2c7k09","country_code":"NL","type":"education","lineage":["https://openalex.org/I98358874"]}],"countries":["NL"],"is_corresponding":true,"raw_author_name":"Massimo A. Achterberg","raw_affiliation_strings":["Delft University of Technology"],"affiliations":[{"raw_affiliation_string":"Delft University of Technology","institution_ids":["https://openalex.org/I98358874"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5084761980","display_name":"Robert E. Kooij","orcid":"https://orcid.org/0000-0001-8654-1550"},"institutions":[{"id":"https://openalex.org/I148297040","display_name":"Netherlands Organisation for Applied Scientific Research","ror":"https://ror.org/01bnjb948","country_code":"NL","type":"nonprofit","lineage":["https://openalex.org/I148297040"]}],"countries":["NL"],"is_corresponding":false,"raw_author_name":"Robert E. Kooij","raw_affiliation_strings":["TNO (Netherlands Organisation for Applied Scientific Research)"],"affiliations":[{"raw_affiliation_string":"TNO (Netherlands Organisation for Applied Scientific Research)","institution_ids":["https://openalex.org/I148297040"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5073262194"],"corresponding_institution_ids":["https://openalex.org/I98358874"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":true,"cited_by_count":0,"citation_normalized_percentile":{"value":0.93717975,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":null,"biblio":{"volume":"30","issue":"1","first_page":"109","last_page":"132"},"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.7947999835014343,"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.7947999835014343,"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.05180000141263008,"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/T10847","display_name":"Advanced Optical Network Technologies","score":0.022700000554323196,"subfield":{"id":"https://openalex.org/subfields/2208","display_name":"Electrical and Electronic Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/greedy-algorithm","display_name":"Greedy algorithm","score":0.7681000232696533},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.49380001425743103},{"id":"https://openalex.org/keywords/simple","display_name":"Simple (philosophy)","score":0.43709999322891235},{"id":"https://openalex.org/keywords/function","display_name":"Function (biology)","score":0.43529999256134033},{"id":"https://openalex.org/keywords/optimization-problem","display_name":"Optimization problem","score":0.3824000060558319},{"id":"https://openalex.org/keywords/greedy-randomized-adaptive-search-procedure","display_name":"Greedy randomized adaptive search procedure","score":0.3677000105381012}],"concepts":[{"id":"https://openalex.org/C51823790","wikidata":"https://www.wikidata.org/wiki/Q504353","display_name":"Greedy algorithm","level":2,"score":0.7681000232696533},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.6351000070571899},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5216000080108643},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.49380001425743103},{"id":"https://openalex.org/C2780586882","wikidata":"https://www.wikidata.org/wiki/Q7520643","display_name":"Simple (philosophy)","level":2,"score":0.43709999322891235},{"id":"https://openalex.org/C14036430","wikidata":"https://www.wikidata.org/wiki/Q3736076","display_name":"Function (biology)","level":2,"score":0.43529999256134033},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.3824000060558319},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3790999948978424},{"id":"https://openalex.org/C126221529","wikidata":"https://www.wikidata.org/wiki/Q3116070","display_name":"Greedy randomized adaptive search procedure","level":3,"score":0.3677000105381012},{"id":"https://openalex.org/C2779530757","wikidata":"https://www.wikidata.org/wiki/Q1207505","display_name":"Quality (philosophy)","level":2,"score":0.35370001196861267},{"id":"https://openalex.org/C3018263672","wikidata":"https://www.wikidata.org/wiki/Q1296251","display_name":"Efficient algorithm","level":2,"score":0.34779998660087585},{"id":"https://openalex.org/C88230418","wikidata":"https://www.wikidata.org/wiki/Q131476","display_name":"Graph theory","level":2,"score":0.328000009059906},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.31450000405311584},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.31439998745918274},{"id":"https://openalex.org/C136197465","wikidata":"https://www.wikidata.org/wiki/Q1729295","display_name":"Variety (cybernetics)","level":2,"score":0.26109999418258667},{"id":"https://openalex.org/C38767284","wikidata":"https://www.wikidata.org/wiki/Q5601715","display_name":"Greedy coloring","level":5,"score":0.25529998540878296}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.7155/jgaa.v30i1.3192","is_oa":true,"landing_page_url":"https://doi.org/10.7155/jgaa.v30i1.3192","pdf_url":"https://jgaa.info/index.php/jgaa/article/download/3192/3021","source":{"id":"https://openalex.org/S33451491","display_name":"Journal of Graph Algorithms and Applications","issn_l":"1526-1719","issn":["1526-1719"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal of Graph Algorithms and Applications","raw_type":"journal-article"}],"best_oa_location":{"id":"doi:10.7155/jgaa.v30i1.3192","is_oa":true,"landing_page_url":"https://doi.org/10.7155/jgaa.v30i1.3192","pdf_url":"https://jgaa.info/index.php/jgaa/article/download/3192/3021","source":{"id":"https://openalex.org/S33451491","display_name":"Journal of Graph Algorithms and Applications","issn_l":"1526-1719","issn":["1526-1719"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal of Graph Algorithms and Applications","raw_type":"journal-article"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W7140044751.pdf","grobid_xml":"https://content.openalex.org/works/W7140044751.grobid-xml"},"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"We":[0],"consider":[1],"the":[2,15,66,74,79,82,89,105,114,147,154,158,165,174,196,199,202,206],"optimisation":[3,91],"problem":[4,26,76,92],"of":[5,46,65,81,107,125,131,141,144,157,167,198],"adding":[6],"$k$":[7],"links":[8],"to":[9,30,55,61,95,173,194,210],"a":[10,57,123,142,192],"given":[11],"network,":[12],"such":[13,33,53,100],"that":[14,34,72,153,205],"resulting":[16],"effective":[17],"graph":[18,45],"resistance":[19],"is":[20,41,50,70,77,93,111,122],"as":[21,23],"small":[22,186],"possible.":[24],"The":[25],"was":[27],"recently":[28],"proven":[29],"be":[31,86,96,162],"NP-hard,":[32],"obtaining":[35],"optimal":[36,67],"solutions":[37],"through":[38,164],"brute-force":[39],"methods":[40],"infeasible":[42],"for":[43],"any":[44],"realistic":[47],"size.":[48],"It":[49,69],"common":[51],"in":[52,129],"cases":[54,101],"use":[56,104],"simple":[58],"greedy":[59,83,159,200,207],"algorithm":[60,160,208],"obtain":[62],"an":[63,139],"approximation":[64],"solution.":[68],"known":[71,94],"if":[73],"considered":[75,90],"submodular,":[78],"quality":[80,156],"solution":[84,155],"can":[85,103],"guaranteed.":[87],"However,":[88],"not":[97],"submodular.":[98],"For":[99],"one":[102],"notion":[106],"generalized":[108,132,168],"submodularity,":[109,169],"which":[110,121],"captured":[112],"by":[113],"submodularity":[115,148],"ratio":[116,149],"$\\gamma$.":[117],"A":[118],"performance":[119,197],"bound,":[120],"function":[124],"$\\gamma$,":[126],"also":[127],"exists":[128],"case":[130],"submodularity.":[133],"In":[134],"this":[135],"paper":[136],"we":[137,180,190],"give":[138],"example":[140],"family":[143],"graphs":[145],"where":[146],"approaches":[150],"zero,":[151],"implying":[152],"cannot":[161],"guaranteed":[163],"concept":[166],"at":[170],"least,":[171],"according":[172],"currently":[175],"available":[176],"theoretical":[177],"results.":[178],"Finally,":[179],"conduct":[181],"some":[182],"numerical":[183],"experiments":[184,203],"on":[185],"graphs.":[187],"Even":[188],"though":[189],"lack":[191],"theory":[193],"guarantee":[195],"algorithm,":[201],"show":[204],"leads":[209],"near-optimal":[211],"solutions.":[212]},"counts_by_year":[],"updated_date":"2026-03-24T05:59:24.953642","created_date":"2026-03-23T00:00:00"}