- INSTANCE: Graph , connectivity requirements and penalties for all , node weights
- SOLUTION: Subgraph in
- COST FUNCTION: weight of plus the sum of penalties for which does not contain at least edge-disjoint paths
- OBJECTIVE: Minimize
*Approx.:*Approximable within approximation ratio , where [31]. Approximable within approximation ratio for minor-closed families of graphs [30].

2015-04-27 Revision: 288 PDF version