Tight Bounds and 2-approximation Algorithms for Integer Programs

0 downloads 0 Views 183KB Size Report
Then, there exists an optimal solution r* such that x* e{0, 1, į} (this was previously .... S, there exists a feasible solution in s(2)Conversely, if (x+, x-) ES(2), then.