Next: Quality of Service Multicast
Up: Steiner Tree Problems
Previous: Polymatroid Steiner Problem
, the edge weights
, a polymatroid
in G such that
, connecting a given root
to all vertices of a least one base of P.
- COST FUNCTION:
- Approx.: Approximable within
in quasi-polynomial time, .
NP-hard to approximate within
The problem contains the Directed Steiner Tree Problem as a special case .
2015-04-27 Revision: 288 PDF version