Fast Approximation Algorithms for the Generalized Survivable Network Design Problem

Andreas Emil Feldmann, Jochen Könemann, Kanstantsin Pashkovich +1

In a standard $f$-connectivity network design problem, we are given an undirected graph $G=(V,E)$, a cut-requirement function $f:2^V\to \mathbb{N}$, and non-negative cos…