{"id":"https://openalex.org/W7214284263","doi":"https://doi.org/10.48550/arxiv.2609.29790","title":"Budget-Constrained Graph Augmentation for Robust Network Design via Kirchhoff Index Minimization","display_name":"Budget-Constrained Graph Augmentation for Robust Network Design via Kirchhoff Index Minimization","publication_year":2026,"publication_date":"2026-09-24","ids":{"openalex":"https://openalex.org/W7214284263","doi":"https://doi.org/10.48550/arxiv.2609.29790"},"language":"en","primary_location":{"id":"pmh:oai:arXiv.org:2609.29790","doi":null,"is_oa":true,"landing_page_url":"https://arxiv.org/abs/2609.29790","pdf_url":"https://arxiv.org/pdf/2609.29790","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":"2331-8422","issn":["2331-8422"],"is_oa":true,"is_in_doaj":false,"is_core":false,"listed_in":[],"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":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"text"},"volume":null,"type":"preprint","is_traditional":true,"indexed_in":["arxiv","datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://arxiv.org/pdf/2609.29790","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5054697678","display_name":"Omkar Bhoite","orcid":null,"observed_orcids":[]},"institutions":[{"id":"https://openalex.org/I204778367","display_name":"Norwegian University of Science and Technology","ror":"https://ror.org/05xg72x27","country_code":"NO","type":"education","lineage":["https://openalex.org/I204778367"]},{"id":"https://openalex.org/I4210100463","display_name":"SRM University, Andhra Pradesh","ror":"https://ror.org/013vs5h31","country_code":"IN","type":"education","lineage":["https://openalex.org/I4210100463"]}],"countries":["IN","NO"],"is_corresponding":false,"raw_author_name":"Bhoite, Omkar","raw_affiliation_strings":["Department of ECE , SRM University-AP , Amaravati 522240 , Andhra Pradesh , India","Department of Electronic Systems , Norwegian University of Science and Technology (NTNU) , Trondheim , 7032 Norway"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of ECE , SRM University-AP , Amaravati 522240 , Andhra Pradesh , India","institution_ids":["https://openalex.org/I4210100463"]},{"raw_affiliation_string":"Department of Electronic Systems , Norwegian University of Science and Technology (NTNU) , Trondheim , 7032 Norway","institution_ids":["https://openalex.org/I204778367"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5152898321","display_name":"V Sateeshkrishna Dhuli","orcid":null,"observed_orcids":[]},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Dhuli, V Sateeshkrishna","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5124213431","display_name":"Stefan Werner","orcid":null,"observed_orcids":[]},"institutions":[{"id":"https://openalex.org/I9927081","display_name":"Aalto University","ror":"https://ror.org/020hwjq30","country_code":"FI","type":"education","lineage":["https://openalex.org/I9927081"]}],"countries":["FI"],"is_corresponding":false,"raw_author_name":"Werner, Stefan","raw_affiliation_strings":["Department of Information and Communication Engineering , Aalto University , Finland"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Information and Communication Engineering , Aalto University , Finland","institution_ids":["https://openalex.org/I9927081"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5086730030","display_name":"Kimmo Kansanen","orcid":"https://orcid.org/0000-0002-7702-7143","observed_orcids":["https://orcid.org/0000-0002-7702-7143"]},"institutions":[{"id":"https://openalex.org/I204778367","display_name":"Norwegian University of Science and Technology","ror":"https://ror.org/05xg72x27","country_code":"NO","type":"education","lineage":["https://openalex.org/I204778367"]}],"countries":["NO"],"is_corresponding":false,"raw_author_name":"Kansanen, Kimmo","raw_affiliation_strings":["Department of Electronic Systems , Norwegian University of Science and Technology (NTNU) , Trondheim , 7032 Norway"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Electronic Systems , Norwegian University of Science and Technology (NTNU) , Trondheim , 7032 Norway","institution_ids":["https://openalex.org/I204778367"]}]}],"institutions":[],"countries_distinct_count":3,"institutions_distinct_count":3,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":true,"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/T10064","display_name":"Complex Network Analysis Techniques","score":0.45730000734329224,"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.45730000734329224,"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/T11476","display_name":"Graph theory and applications","score":0.1712999939918518,"subfield":{"id":"https://openalex.org/subfields/2607","display_name":"Discrete Mathematics and Combinatorics"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"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.10509999841451645,"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/network-robustness","display_name":"network robustness","score":0.7860000133514404},{"id":"https://openalex.org/keywords/graph-data-augmentation","display_name":"graph augmentation","score":0.7979999780654907},{"id":"https://openalex.org/keywords/kirchhoff-index","display_name":"Kirchhoff index","score":0.9929999709129333},{"id":"https://openalex.org/keywords/network-design","display_name":"network design","score":0.5130000114440918},{"id":"https://openalex.org/keywords/edge-selection","display_name":"edge selection","score":0.4000000059604645},{"id":"https://openalex.org/keywords/budget-constraints","display_name":"budget constraints","score":0.7570000290870667},{"id":"https://openalex.org/keywords/semidefinite-relaxation","display_name":"semidefinite relaxation","score":0.9980000257492065},{"id":"https://openalex.org/keywords/cone-programming","display_name":"cone programming","score":0.8550000190734863},{"id":"https://openalex.org/keywords/operator-splitting","display_name":"operator splitting","score":0.6869999766349792},{"id":"https://openalex.org/keywords/greedy-algorithm","display_name":"greedy algorithm","score":0.9750000238418579},{"id":"https://openalex.org/keywords/spectral-lower-bound","display_name":"spectral lower bound","score":0.6549999713897705},{"id":"https://openalex.org/keywords/infrastructure-systems","display_name":"infrastructure networks","score":0.7129999995231628}],"concepts":[{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.6355999708175659},{"id":"https://openalex.org/C63479239","wikidata":"https://www.wikidata.org/wiki/Q7353546","display_name":"Robustness (evolution)","level":3,"score":0.5166000127792358},{"id":"https://openalex.org/C41608201","wikidata":"https://www.wikidata.org/wiki/Q980509","display_name":"Embedding","level":2,"score":0.4997999966144562},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.49230000376701355},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.47749999165534973},{"id":"https://openalex.org/C147764199","wikidata":"https://www.wikidata.org/wiki/Q6865248","display_name":"Minification","level":2,"score":0.4683000147342682},{"id":"https://openalex.org/C115178988","wikidata":"https://www.wikidata.org/wiki/Q772067","display_name":"Laplacian matrix","level":3,"score":0.46299999952316284},{"id":"https://openalex.org/C101901036","wikidata":"https://www.wikidata.org/wiki/Q2269096","display_name":"Semidefinite programming","level":2,"score":0.39730000495910645},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.39419999718666077},{"id":"https://openalex.org/C173801870","wikidata":"https://www.wikidata.org/wiki/Q201413","display_name":"Heuristic","level":2,"score":0.36899998784065247},{"id":"https://openalex.org/C2776029896","wikidata":"https://www.wikidata.org/wiki/Q3935810","display_name":"Relaxation (psychology)","level":2,"score":0.3659000098705292},{"id":"https://openalex.org/C2780009758","wikidata":"https://www.wikidata.org/wiki/Q6804172","display_name":"Measure (data warehouse)","level":2,"score":0.34950000047683716},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.3474999964237213},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.31850001215934753},{"id":"https://openalex.org/C185798385","wikidata":"https://www.wikidata.org/wiki/Q1161707","display_name":"Benchmark (surveying)","level":2,"score":0.31529998779296875},{"id":"https://openalex.org/C114563136","wikidata":"https://www.wikidata.org/wiki/Q19725982","display_name":"Network planning and design","level":2,"score":0.313400000333786},{"id":"https://openalex.org/C193254401","wikidata":"https://www.wikidata.org/wiki/Q2160088","display_name":"Robust optimization","level":2,"score":0.3061999976634979},{"id":"https://openalex.org/C74003402","wikidata":"https://www.wikidata.org/wiki/Q3180727","display_name":"Spectral graph theory","level":5,"score":0.30379998683929443},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3021000027656555},{"id":"https://openalex.org/C48044578","wikidata":"https://www.wikidata.org/wiki/Q727490","display_name":"Scalability","level":2,"score":0.2971999943256378},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.28850001096725464},{"id":"https://openalex.org/C15627037","wikidata":"https://www.wikidata.org/wiki/Q541961","display_name":"Classification of discontinuities","level":2,"score":0.28690001368522644},{"id":"https://openalex.org/C165700671","wikidata":"https://www.wikidata.org/wiki/Q203484","display_name":"Laplace operator","level":2,"score":0.2865000069141388},{"id":"https://openalex.org/C111335779","wikidata":"https://www.wikidata.org/wiki/Q3454686","display_name":"Reduction (mathematics)","level":2,"score":0.2840000092983246},{"id":"https://openalex.org/C51823790","wikidata":"https://www.wikidata.org/wiki/Q504353","display_name":"Greedy algorithm","level":2,"score":0.27549999952316284},{"id":"https://openalex.org/C55689738","wikidata":"https://www.wikidata.org/wiki/Q15963867","display_name":"Discrete time and continuous time","level":2,"score":0.27489998936653137},{"id":"https://openalex.org/C17020691","wikidata":"https://www.wikidata.org/wiki/Q139677","display_name":"Operator (biology)","level":5,"score":0.27239999175071716},{"id":"https://openalex.org/C199845137","wikidata":"https://www.wikidata.org/wiki/Q145490","display_name":"Network topology","level":2,"score":0.2718000113964081},{"id":"https://openalex.org/C2778945305","wikidata":"https://www.wikidata.org/wiki/Q6865502","display_name":"Minimum weight","level":2,"score":0.2687000036239624},{"id":"https://openalex.org/C39927690","wikidata":"https://www.wikidata.org/wiki/Q11197","display_name":"Logarithm","level":2,"score":0.2676999866962433},{"id":"https://openalex.org/C155253501","wikidata":"https://www.wikidata.org/wiki/Q461992","display_name":"Interior point method","level":2,"score":0.2603999972343445},{"id":"https://openalex.org/C158968445","wikidata":"https://www.wikidata.org/wiki/Q7631150","display_name":"Subgradient method","level":2,"score":0.2565999925136566}],"mesh":[],"locations_count":2,"locations":[{"id":"pmh:oai:arXiv.org:2609.29790","doi":null,"is_oa":true,"landing_page_url":"https://arxiv.org/abs/2609.29790","pdf_url":"https://arxiv.org/pdf/2609.29790","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":"2331-8422","issn":["2331-8422"],"is_oa":true,"is_in_doaj":false,"is_core":false,"listed_in":[],"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":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"text"},{"id":"doi:10.48550/arxiv.2609.29790","doi":"https://doi.org/10.48550/arxiv.2609.29790","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2609.29790","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":"2331-8422","issn":["2331-8422"],"is_oa":true,"is_in_doaj":false,"is_core":false,"listed_in":[],"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":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"Preprint"}],"best_oa_location":{"id":"pmh:oai:arXiv.org:2609.29790","doi":null,"is_oa":true,"landing_page_url":"https://arxiv.org/abs/2609.29790","pdf_url":"https://arxiv.org/pdf/2609.29790","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":"2331-8422","issn":["2331-8422"],"is_oa":true,"is_in_doaj":false,"is_core":false,"listed_in":[],"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":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"text"},"sustainable_development_goals":[{"score":0.7207000255584717,"display_name":"Industry, innovation and infrastructure","id":"https://metadata.un.org/sdg/9"}],"study_designs":[],"awards":[{"id":"https://openalex.org/G3112383080","display_name":"DOCTORAL PROGRAMME FOR INTEGRATED RESEARCH ACTIVITIES TO UNLOCK A POTENTIAL OF TOP-LEVEL RESEARCHERS IN DIGITAL TRANSFORMATION FOR SUSTAINABILITY","funder_award_id":"101034240","funder_id":"https://openalex.org/F4320320300","funder_display_name":"European Commission"}],"funders":[{"id":"https://openalex.org/F4320320300","display_name":"European Commission","ror":"https://ror.org/00k4n6c32"}],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W7214284263.pdf","grobid_xml":"https://content.openalex.org/works/W7214284263.grobid-xml"},"referenced_works_count":1,"referenced_works":["https://openalex.org/W1717141654"],"related_works":["https://openalex.org/W2157138898","https://openalex.org/W2102909472","https://openalex.org/W1985538586","https://openalex.org/W4387579733","https://openalex.org/W6947907746","https://openalex.org/W2740521317","https://openalex.org/W4387575198","https://openalex.org/W4249556754","https://openalex.org/W7096717583","https://openalex.org/W2773866723"],"abstract_inverted_index":{"Enhancing":[0],"the":[1,37,92,97,133,174,202],"robustness":[2],"of":[3,47],"deployed":[4],"networks":[5,184],"against":[6],"failures":[7],"and":[8,23,70,85,103,112,124,155,158,181,191,206],"disruptions":[9],"is":[10],"critical":[11],"for":[12],"reliable":[13],"operation.":[14],"This":[15],"requires":[16],"deciding":[17],"which":[18],"new":[19],"links":[20,212],"to":[21,26,132,214],"install":[22],"how":[24],"strongly":[25],"weight":[27,60,189],"them":[28],"under":[29,62,196],"limited":[30],"resources.":[31],"We":[32,95],"study":[33],"this":[34,80],"problem":[35,53],"through":[36,121,162],"Kirchhoff":[38],"index,":[39],"or":[40],"total":[41,68],"effective":[42],"resistance,":[43],"a":[44,67,75,82,86,100,108,140,163,168],"spectral":[45,170],"measure":[46],"global":[48],"connectivity.":[49],"The":[50],"resulting":[51],"augmentation":[52],"couples":[54],"discrete":[55,117],"candidate-edge":[56],"selection":[57],"with":[58,167],"continuous":[59],"allocation":[61],"heterogeneous":[63],"per-unit":[64,216],"deployment":[65],"costs,":[66],"budget,":[69],"an":[71,145],"exact-cardinality":[72],"constraint.":[73],"For":[74],"fixed":[76,197],"weighted":[77],"base":[78],"graph,":[79],"yields":[81],"mixed-integer":[83,93],"formulation":[84],"semidefinite":[87,135],"relaxation":[88,98],"whose":[89],"optimum":[90],"lower-bounds":[91],"optimum.":[94],"cast":[96],"as":[99],"cone":[101],"program":[102,136],"solve":[104],"it":[105],"numerically":[106],"using":[107],"homogeneous":[109],"self-dual":[110],"embedding":[111],"first-order":[113],"operator":[114],"splitting.":[115],"Feasible":[116],"designs":[118],"are":[119],"recovered":[120],"rounding-and-repair":[122],"procedures":[123],"assessed":[125],"by":[126],"\\emph{a":[127],"posteriori}":[128],"gap":[129],"estimates":[130],"relative":[131,213],"numerical":[134],"(SDP)":[137],"benchmark.":[138],"As":[139],"scalable":[141],"alternative,":[142],"we":[143],"develop":[144],"exact-$k$,":[146],"budget-feasible":[147],"greedy":[148],"heuristic":[149],"built":[150],"on":[151,173,179],"rank-one":[152],"Laplacian":[153],"updates":[154],"biharmonic-distance":[156],"caching,":[157],"interpret":[159],"its":[160],"progress":[161],"Bellman":[164],"value-to-go":[165],"benchmark":[166],"conservative":[169],"lower":[171],"bound":[172],"local":[175],"policy":[176],"ratio.":[177],"Experiments":[178],"synthetic":[180],"real":[182],"infrastructure":[183],"across":[185],"graph":[186],"sizes,":[187],"budgets,":[188,198],"distributions,":[190],"cost":[192],"regimes":[193],"show":[194],"that,":[195],"distance-proportional":[199],"costs":[200],"limit":[201],"achievable":[203],"resistance":[204],"reduction":[205],"shift":[207],"installed":[208],"conductance":[209],"toward":[210],"shorter":[211],"uniform":[215],"costs.":[217]},"counts_by_year":[],"updated_date":"2026-11-07T11:25:07.637180","created_date":"2026-09-26T00:00:00"}