- INSTANCE: Graph , cost function , set of demands , integer
- SOLUTION: A forest in such that at least pairs from are connected by .
- COST FUNCTION: .
- OBJECTIVE: Minimize.
*Approx.:*Approximable within [111].*Hardness:*NP-hard.

2015-04-27 Revision: 288 PDF version