Optimization of Unweighted Minimum Vertex Cover

The Minimum Vertex Cover (MVC) problem is a classic graph optimization NP complete problem. In this paper a competent algorithm, called Vertex Support Algorithm (VSA), is designed to find the smallest vertex cover of a graph. The VSA is tested on a large number of random graphs and DIMACS benchmark graphs. Comparative study of this algorithm with the other existing methods has been carried out. Extensive simulation results show that the VSA can yield better solutions than other existing algorithms found in the literature for solving the minimum vertex cover problem. Keywords—vertex cover, vertex support, approximation algorithms, NP complete problem.

[1]  M. Weigt,et al.  Minimal vertex covers on finite-connectivity random graphs: a hard-sphere lattice-gas picture. , 2000, Physical review. E, Statistical, nonlinear, and soft matter physics.

[2]  Béla Bollobás,et al.  Random Graphs , 1985 .

[3]  Dorit S. Hochbaum,et al.  Efficient bounds for the stable set, vertex cover and set packing problems , 1983, Discret. Appl. Math..

[4]  Piotr Berman,et al.  On Approximation Properties of the Independent Set Problem for Low Degree Graphs , 1999, Theory of Computing Systems.

[5]  David S. Johnson,et al.  Computers and In stractability: A Guide to the Theory of NP-Completeness. W. H Freeman, San Fran , 1979 .

[6]  Ulrike Stege,et al.  Solving large FPT problems on coarse-grained parallel machines , 2003, J. Comput. Syst. Sci..

[7]  Bertrand M. T. Lin,et al.  An Ant Colony Optimization Algorithm for the Minimum Weight Vertex Cover Problem , 2004, Ann. Oper. Res..

[8]  Alexander K. Hartmann,et al.  The number of guards needed by a museum: A phase transition in vertex covering of random graphs , 2000, Physical review letters.

[9]  Charu C. Aggarwal,et al.  Optimized Crossover for the Independent Set Problem , 1997, Oper. Res..

[10]  Wayne Pullan.  Optimisation of unweighted/weighted maximum independent sets and minimum vertex covers , 2009, Discret. Optim..

[11]  Jun Ma,et al.  An efficient simulated annealing algorithm for the minimum vertex cover problem , 2006, Neurocomputing.

[12]  Gilbert Laporte,et al.  An exact quadratic 0-1 algorithm for the stable set problem , 1993, Cliques, Coloring, and Satisfiability.

[13]  Ewald Speckenmeyer,et al.  Ramsey numbers and an approximation algorithm for the vertex cover problem , 1985, Acta Informatica.

[14]  Kengo Katayama,et al.  An effective local search for the maximum clique problem , 2005, Inf. Process. Lett..

[15]  Ulrike Stege,et al.  Resolving conflicts in problems from computational biology , 1999 .

[16]  David S. Johnson,et al.  Some Simplified NP-Complete Graph Problems , 1976, Theor. Comput. Sci..

[17]  Xiaoming Chen,et al.  An Algorithm Based on Hopfield Network Learning for Minimum Vertex Cover Problem , 2004, ISNN.