Suppose algorithm A is given for a maximization problem and we are asked to show that it is a 1/2-approximation algorithm.
As you know it is enough to show
Sol >= 1/2 OPT
What I need to know is, is it true to assume this problem as a minimization one and prove
Sol <= 2 OPT
Or is there any correspondence between these two?