an edge packing y is maximal if there is no other feasible edge packing y' such that y \le y' |
An edge packing y is maximal if there is no other feasible edge packing y' such that y ≤ y'. (In other words, no edge weight can be increased without violating some constraint in the dual.) |
* * [http://www.cs.ucr.edu/~neal/index.cgi?b=abstracts#Khuller94Primal |
* [http://www.cs.ucr.edu/~neal/index.cgi?b=abstracts#Khuller94Primal |
Dual: maximum edge packing:
cost(OPT vertex cover) ≥ cost(any feasible solution to the dual)
(follows from weak duality.)
An edge packing y is maximal if there is no other feasible edge packing y' such that y ≤ y'. (In other words, no edge weight can be increased without violating some constraint in the dual.)
algorithm
prove: the algorithm is a 2-approximation algorithm