| Article ID: | iaor20061797 |
| Country: | Netherlands |
| Volume: | 34 |
| Issue: | 1 |
| Start Page Number: | 77 |
| End Page Number: | 84 |
| Publication Date: | Jan 2006 |
| Journal: | Operations Research Letters |
| Authors: | Nobili Paolo, Galluccio Anna |
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