Solving min ones 2-sat as fast as vertex cover

The problem of finding a satisfying assignment that minimizes the number of variables that are set to 1 is NP-complete even for a satisfiable 2-SAT formula. We call this problem min ones 2-sat. It generalizes the well-studied problem of finding the smallest vertex cover of a graph, which can be modeled using a 2-SAT formula with no negative literals. The natural parameterized version of the problem asks for a satisfying assignment of weight at most k.In this paper, we present a polynomial-time reduction from min ones 2-sat to vertex cover without increasing the parameter and ensuring that the number of vertices in the reduced instance is equal   to the number of variables of the input formula. Consequently, we conclude that this problem also has a simple 2-approximation algorithm and a 2k−clogk-variable kernel subsuming (or, in the case of kernels, improving) the results known earlier. Further, the problem admits algorithms for the parameterized and optimization versions whose runtimes will always match the runtimes of the best-known algorithms for the corresponding versions of vertex cover.Finally we show that the optimum value of the LP relaxation of the min ones 2-sat and that of the corresponding vertex cover are the same. This implies that the (recent) results of vertex cover version parameterized above the optimum value of the LP relaxation of vertex cover carry over to the min ones 2-sat version parameterized above the optimum of the LP relaxation of min ones 2-sat.