Budget-Constrained Graph Augmentation for Robust Network Design via Kirchhoff Index Minimization

2026-09-24

AI Summary

This study addresses the problem of graph augmentation under budget constraints, aiming to enhance network robustness by jointly optimizing link installation and weight allocation to minimize the Kirchhoff index. Methodologically, a mixed-integer programming formulation is proposed alongside a semidefinite relaxation lower bound. To ensure scalability, a greedy heuristic algorithm is designed that leverages Laplacian matrix updates and biharmonic distance caching, efficiently solved via conic programming and first-order operator splitting techniques. Experimental results demonstrate that the proposed approach significantly reduces the effective resistance of networks. Furthermore, this work reveals how distance-proportional costs constrain robustness improvements and induce a preference for short-range links.

Abstract

Enhancing the robustness of deployed networks against failures and disruptions is critical for reliable operation. This requires deciding which new links to install and how strongly to weight them under limited resources. We study this problem through the Kirchhoff index, or total effective resistance, a spectral measure of global connectivity. The resulting augmentation problem couples discrete candidate-edge selection with continuous weight allocation under heterogeneous per-unit deployment costs, a total budget, and an exact-cardinality constraint. For a fixed weighted base graph, this yields a mixed-integer formulation and a semidefinite relaxation whose optimum lower-bounds the mixed-integer optimum. We cast the relaxation as a cone program and solve it numerically using a homogeneous self-dual embedding and first-order operator splitting. Feasible discrete designs are recovered through rounding-and-repair procedures and assessed by \emph{a posteriori} gap estimates relative to the numerical semidefinite program (SDP) benchmark. As a scalable alternative, we develop an exact-$k$, budget-feasible greedy heuristic built on rank-one Laplacian updates and biharmonic-distance caching, and interpret its progress through a Bellman value-to-go benchmark with a conservative spectral lower bound on the local policy ratio. Experiments on synthetic and real infrastructure networks across graph sizes, budgets, weight distributions, and cost regimes show that, under fixed budgets, distance-proportional costs limit the achievable resistance reduction and shift installed conductance toward shorter links relative to uniform per-unit costs.

Problem

• network robustness
• graph augmentation
• Kirchhoff index
• budget constraint
• effective resistance

Innovation

• Kirchhoff index minimization
• semidefinite relaxation
• greedy heuristic
• rank-one Laplacian updates
• biharmonic-distance caching