On the Structure of Minimum-Weight k-Connected Spanning Networks
From MaRDI portal
Publication:3490035
DOI10.1137/0403027zbMath0708.05053MaRDI QIDQ3490035
Bienstock, Daniel, Clyde l. Monma, Ernest F. Brickell
Publication date: 1990
Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/0403027
90C35: Programming involving graphs or networks
05C85: Graph algorithms (graph-theoretic aspects)
94C15: Applications of graph theory to circuits and networks
05C40: Connectivity
Related Items
Extremal graphs in connectivity augmentation, Minimum-weight two-connected spanning networks, On shredders and vertex connectivity augmentation, The \(k\)-edge connected subgraph problem. I: Polytopes and critical extreme points., On shortest three-edge-connected Steiner networks with Euclidean distance, On the minimum-cost \(\lambda\)-edge-connected \(k\)-subgraph problem, Property testing on \(k\)-vertex-connectivity of graphs, \(k\)-edge connected polyhedra on series-parallel graphs, Minimum Cost ≤k Edges Connected Subgraph Problems, A branch-and-cut algorithm for the k-edge connected subgraph problem, On the Steiner 2-edge connected subgraph polytope