An edge-reduction algorithm for the vertex cover problem

An edge-reduction algorithm for the vertex cover problem

0.00 Avg rating0 Votes
Article ID: iaor20102954
Volume: 37
Issue: 3
Start Page Number: 181
End Page Number: 186
Publication Date: May 2009
Journal: Operations Research Letters
Authors: , ,
Keywords: vertex cover
Abstract:

An approximation algorithm for the vertex cover problem is proposed with performance ratio 3/2 on special graphs. On an arbitrary graph, the algorithm guarantees a vertex cover S1 such that |S1|32|S|+ξ equ1 where S* is an optimal cover and ξ is an error bound identified.

Reviews

Required fields are marked *. Your email address will not be published.