12 citations · 21 across the 9 of their papers we have counts for
1 paper · 1 filter
Vishnu V. Narayan
We obtain a polynomial-time 17/12-approximation algorithm for the minimum-cost 2-vertex-connected spanning subgraph problem, restricted to graphs of minimum degree at least 3. Our…