We provide a new LP relaxation of the maximum vertex cover problem and a polynomial-time algorithm that finds a solution within the approximation factor 1-1/(2\bar q), where \bar q is the size of the smallest clique in a given clique-partition of the edge weighting of G.
Improved approximation of Maximum Vertex Cover
Galluccio A;
2006
Abstract
We provide a new LP relaxation of the maximum vertex cover problem and a polynomial-time algorithm that finds a solution within the approximation factor 1-1/(2\bar q), where \bar q is the size of the smallest clique in a given clique-partition of the edge weighting of G.File in questo prodotto:
Non ci sono file associati a questo prodotto.
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.