Survivable Network Design for Group Connectivity in Low-Treewidth Graphs

international workshop and international workshop on approximation, randomization, and combinatorial optimization. algorithms and techniques, 2018.

Cited by: 0|Bibtex|Views24|Links
EI

Abstract:

In the Group Steiner Tree problem (GST), we are given a (edge or vertex)-weighted graph G=(V,E) on n vertices, together with a root vertex r and a collection of groups {S_i}_{i in [h]}: S_i subseteq V(G). The goal is to find a minimum-cost subgraph H that connects the root to every group. We consider a fault-tolerant variant of GST, which...More

Code:

Data:

Your rating :
0

 

Tags
Comments