Problem 1(continued)
5 points 1e) The Greedy algorithm for set cover always
gives a more accurate result than the LP-algorithm for set cover.
5 points 1f) The solution (1,1,0) is a minimal solution to the
linear programming problem:
minimize x1 + x2 + x3 given that x1 + x2 > 1, x1 + x3 > 1, x2 + x3 > 1
5 points 1g) Knapsack problems with the given class of value/weight distribution are known to be solvable in time O(n3)
False, sometimes LP is better, sometimes Greedy is better
True, it is minimal though not minimum
True, actually O(nlog(n))