On finding highly connected spanning subgraphs

Manu Basavaraju, Pranabendu Misra, M. S. Ramanujan +1

In the Survivable Network Design Problem (SNDP), the input is an edge-weighted (di)graph $G$ and an integer $r_{uv}$ for every pair of vertices $u,v\in V(G)$. The objective is to c…