Consider a different rounding strategy for the LP relaxation of the vertex cover problem. Instead of rounding up every vertex whose value is at least 0.5 after running the LP, we do the following:

We look at every edge, and then we round up the variable of the endpoint with the highest value, where in case of ties we take the endpoint with the highest index.

In other words, if the vertex set is V=\left\{v_1, \ldots, v_n\right\} and we denote the associated variable of v_i by x_i then the cover C is computed as follows:

C:=\left\{v_i \in V:\right. there is an edge \left(v_i, v_j\right) such that \left(x_i>x_j\right) or \left(x_i=x_j\right. and \left.\left.i>j\right)\right\}

Which statement is true?

- This does not work, because we might report an invalid solution.
- This gives a valid solution, but the approximation ratio becomes worse.
- This gives a valid solution, and in fact the solution is always exactly the same as in the original rounding scheme.
- This gives a valid solution. We sometimes report a better solution than in the original rounding scheme, but the approximation ratio of the algorithm is still more than 2 - \epsilon for any \epsilon > 0.
- This gives a valid solution, and the approximation ratio of the algorithm becomes 3/2.