What would you like to understand?

For minimization problems, the guarantee is $C \leq \rho(n) \cdot C^*$. For maximization problems, it is $C \geq \frac{C^*}{\rho(n)}$.

Conditions: C is the algorithm-produced cost.; C* is the true optimal cost.; rho(n) is the approximation bound.

For minimization problems, the guarantee is $C \leq \rho(n) \cdot C^*$. For maximization problems, it is $C \geq \frac{C^*}{\rho(n)}$.

Conditions: C is the algorithm-produced cost.; C* is the true optimal cost.; rho(n) is the approximation bound.