I am studying the approximation algorithm. I have a question as follows.

For an approximation algorithm for maximization problem, if I have $sol \ge \alpha opt - c$, where $c$ is a positive constant and $0 < \alpha < 1$, can i say that this algorithm is $\alpha$-apx? Why?



Your Answer

By clicking “Post Your Answer”, you agree to our terms of service and acknowledge you have read our privacy policy.

Browse other questions tagged or ask your own question.