What would you like to understand?

An approximation bound is a guaranteed multiplicative limit on how much worse the algorithm's result can be than the true optimum in the worst case.

Conditions: Used for minimization or maximization problems.; Expresses a worst-case guarantee relative to the optimum.

An approximation bound is a guaranteed multiplicative limit on how much worse the algorithm's result can be than the true optimum in the worst case.

Conditions: Used for minimization or maximization problems.; Expresses a worst-case guarantee relative to the optimum.

It means that in the worst case, the algorithm's output cost is at most twice the true optimal cost.

Conditions: The problem is a minimization problem.; The algorithm is a 2-approximation.

It means that in the worst case, the algorithm's output cost is at most twice the true optimal cost.

Conditions: The problem is a minimization problem.; The algorithm is a 2-approximation.