Algorithms for 2-connected network design and flexible Steiner trees with a constant number of terminals

Ishan Bansal, Joe Cheriyan, Logan Grout +1

The $k$-Steiner-2NCS problem is as follows: Given a constant $k$, and an undirected connected graph $G=(V,E)$, non-negative costs $c$ on $E$, and a partition $(T,V-T)$ of $V$ in…