- INSTANCE: An undirected multigraph , set of terminals S V.
- SOLUTION: A set of Steiner trees for in which have pairwise disjoint sets of edges.
- COST FUNCTION:
- OBJECTIVE: Maximize.
*Approx.:*Approximable within , where n denotes the number of nodes [34].*Hardness:*Not approximable within unless . APX-hard for four terminals [34].

2015-04-27 Revision: 288 PDF version