Let OPT(B) be the value of an optimal solution to this problem.
{"Image DocumentName": "Let OPT(B) be the value of an optimal solution to this problem.", "Image ImageDescription": "Ideal Approximation. Minimum cost Steiner network with degree constraints: Given a cost c(e) on each edge, find a Steiner network with minimum total cost, so that every vertex has degree at most B. Let OPT(B) be the value of an optimal solution to this problem. Ideally, we would like to return a solution so that: SOL(B) \u2264 c\u00b7OPT(B) However, it cannot be done for any polynomial factor, even for B=2, since this generalizes the minimum cost Hamiltonian path problem.", "Image XResolution": "37", "Image YResolution": "37", "Image ResolutionUnit": "Pixels/Centimeter", "Image Software": "SlidePlayer", "Image YCbCrPositioning": "Centered"}