scientific article
From MaRDI portal
Publication:2921668
zbMath1297.05134MaRDI QIDQ2921668
Publication date: 13 October 2014
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (9)
Minimum augmentation of edge-connectivity between vertices and sets of vertices in undirected graphs ⋮ Edge-Connectivity Augmentations of Graphs and Hypergraphs ⋮ A unifying approach to splitting-off ⋮ Tight approximation algorithm for connectivity augmentation problems ⋮ Local edge-connectivity augmentation in hypergraphs is NP-complete ⋮ A note on Rooted Survivable Networks ⋮ Approximating Steiner Networks with Node Weights ⋮ Minimum augmentation of edge-connectivity with monotone requirements in undirected graphs ⋮ Inapproximability of survivable networks
This page was built for publication: