- INSTANCE: Graph , monotone activation functions for the edges , monotone property of subgraphs of
- SOLUTION: Assignment such that the subgraph induced by the activated edges (i.e. ) is contained in
- COST FUNCTION:
- OBJECTIVE: Minimize
*Approx.:*If every inclusion minimal edge-set with has maximum degree at most and the underlying Edge-Costs Network Design Problem with property admits a -approximation algorithm, the problem is approximable within approximation ratio [92,51].

2015-04-27 Revision: 288 PDF version