|
prove: The cost of S is at most twice the minimum cost of any vertex cover. The ratio : (cost of optimal solution to original problem)/(cost of optimal solution to relaxed problem) |
|
is called the integrality gap of the integer linear program. (In case of a maximization problem, the integrality gap is the reciprocal. The integrality gap of the problem is the worst-case integrality gap for any instance of the problem. prove: The integrality gap of the above integer linear program for min-cost vertex cover is 2. |
|
prove: The cost of S is at most twice the minimum cost of any vertex cover. |
|
prove: The IntegralityGap of the above integer linear program for min-cost vertex cover is 2. |