Survivable Network Design for Group Connectivity in Low-Treewidth Graphs

Parinya Chalermsook, Syamantak Das, Guy Even +2

In the Group Steiner Tree problem (GST), we are given a (vertex or edge)-weighted graph $G=(V,E)$ on $n$ vertices, a root vertex $r$ and a collection of groups $\{S_i\}_{i\in[h]}:…