An O(log n)-Approximatio

An O(log n)-Approximation
An O(log n)-Approximation Algorithm for (p,q)-Flexible Graph Connectivity via Independent Rounding

In the $(p,q)$-Flexible Graph Connectivity problem, the input is a graph $G = (V,E)$ with the edge set $E = mathscr{S} cup mathscr{U}$ partitioned into safe and unsafe edges, and the goal is to find a minimum cost set of edges $F$ such that the subgraph $(V,F)$ remains $p$-edge-connected after remov…