- INSTANCE: Graph , set of terminals .
- SOLUTION: A set of Steiner trees for in with pairwise disjoint sets of Steiner nodes.
- COST FUNCTION: (the number of trees)
- OBJECTIVE: Maximize.
*Approx.:*Approximable within [67].*Hardness:*APX-hard even for [1]. NP-hard to approximate within [34].

2015-04-27 Revision: 288 PDF version