History of VertexCoverByRounding

Top | recent changes | Preferences


Revision 2 . . January 23, 2004 4:04 pm by NealYoung
Revision 1 . . January 23, 2004 4:04 pm by NealYoung
  

Difference (from prior major revision) (no other diffs)

Removed: 7,11d6
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)

Changed: 13,18c8
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.

Added: 19a10
prove: The IntegralityGap of the above integer linear program for min-cost vertex cover is 2.

Top | recent changes | Preferences
Search: