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": "Bicriteria Approximation Algorithms. 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. A (c,f(B))-approximation algorithm if it returns a solution with. maximum degree f(B) SOL(f(B)) \u2264 c\u00b7OPT(B) e.g. f(B)=2B+1. This implies a c-approximation for minimum cost Steiner network, and an f(B)-approximation for minimum degree Steiner network.", "Image XResolution": "37", "Image YResolution": "37", "Image ResolutionUnit": "Pixels/Centimeter", "Image Software": "SlidePlayer", "Image YCbCrPositioning": "Centered"}