{"references": ["Bollobas. B : Random graphs (2nd Ed.). Cambridge, UK: Cambridge\nUniversity press, 2001.", "Berman. P and Fujito. T: On approximation properties of the independent\nset problem for low degree graphs, Theory of Computing Syst., vol. 32,\npp. 115 - 132, 1999.", "Chvatal, V. (1979). \"A Greedy-Heuristic for the Set Cover Problem.\"\nMathematics of Operations Research 4, 233-235.", "Clarkson, K.L (1983). \"A Modification of the Greedy Algorithm for\nVertex Cover.\" Information Processing Lettters 16, 23-25.", "Cormen. T. H, C. E. Leiserson, R. L. R., and Stein. C: Introduction to\nalgorithms, 2nd ed., McGraw - Hill, New York , 2001.", "Dehne. F, et al.: Solving large FPT problems on coarse grained parallel\nmachines, Available: http://www.scs.carleton.ca/fpt/papers/index.htm.", "Fellows. M. R: On the complexity of vertex cover problems, Technical\nreport, Computer science department, University of New Mexico, 1988.", "Garey. M. R, Johnson. D. S: Computers and Intractability: A Guide to\nthe theory NP - completeness. San Francisco: Freeman ,1979.", "Garey. M. R, Johnson. D. S, and Stock Meyer. L: Some simplified NP\n- complete graph problems, Theoretical computer science, Vol.1563, pp.\n561 - 570, 1999.\n[10] Glover. F: Tabu Search - Part I, ORSA journal of computing, vol. 1,\nNo.3, (1989), pp. 190 - 206.\n[11] Glover. F: Tabu search: A Tutorial, Interface 20, pp. 74 - 94, 1990.\n[12] Gomes. F. C, Meneses. C. N, Pardalos. P. M and Viana. G. V. R: Experimental\nanalysis of approximation algorithms for the vertex cover and set\ncovering problems, Journal of computers and Operations Research, vol.\n33, pp. 3520 - 3534, 2006.\n[13] Hastad. J: Some Optimal Inapproximability Results., Journal of the\nACM, vol. 48, No.4, pp. 798 - 859, 2001.\n[14] Hochbaum. D. S: Approximation algorithm for the set covering and\nvertex cover problems, SIAM Journal on computing, 11(3), 555 - 6, 1982.\n[15] D. Holliday, R. Resnick, J. Walker, Fundamentals of physics, John Wiley\nand Sons, 1993.\n[16] Johnson. D.S, Approximation Algorithms for Combinatorial problems,\nJ.Comput.System Sci.9(1974)256-278.\n[17] Johnson, D.s., C.R Aragon, L.A. McGeoch, and C. Schevon. (1989).\n\"Optimization by Simulated Anealing: An Experimental Evaluation, Part\nI: Graph Partitioning.\" Operations Research 37, 875-892.\n[18] Johnson, D.S., C.R. Aragon, L.A. McGeoch, and C.Schevon. (1989b).\n\"Optimization by Simulated Annealing: An Experimental Evaluation, part\nII: Graph Coloring and Number Partitioning.\" Operations Research 39,\n378-406.\n[19] Karp. R. M: Reducibility among combinatorial problems, Plenum Press,\nNew York, pp. 85 - 103, 1972.\n[20] I.R. Kenyon, General Relativity, Oxford University Press, 1990.\n[21] Khuri S, Back Th. An Evolutionary heuristic for the minimum vertexcover\nproblem. 18th Deutche Jahrestagung fur Kunstliche. Max-Planck\nInstitut fur Informatik Journal 1994;MPI-I-94-241:86-90.\n[22] Likas, A and Stafylopatis, A: A parallel algorithm for the minimum\nweighted vertex cover problem, Information Processing Letters, vol. 53,\npp. 229 - 234, 1995.\n[23] R. Mansouri, F. Nasseri, M. Khorrami, Effective time variation of G\nin a model universe with variable space dimension, Physics Letters 259\n(1999) 194-200.\n[24] Motwani, R. (1992). \"Lecture Notes on Application. \" Technical Report,\nSTAN-CS-92-1435, Department of Computer Science, Stanford University.\n[25] Motwani. R: Lecture Notes on Approximation Algorithms, Technical\nReport, STAN-CS-92-1435, Department of Computer Science, Stanford\nUniversity, 1992.\n[26] Neidermeier. R and Rossmanith. P: On efficient fixed-parameter algorithms\nfor weighted vertex cover, Journal of Algorithms, vol. 47, pp. 63\n- 77, 2003.\n[27] Pitt. L: A Simple Probabilistic Approximation Algorithm for Vertex\nCover, Technical Report, YaleU/DCS/TR-404, Department of Computer\nScience, Yale University, 1985.\n[28] E. Rashedi, Gravitational Search Algorithm, M.Sc. Thesis, Shahid\nBahonar University of Kerman, Kerman, Iran, 2007 (in Farsi).\n[29] B. Schutz, Gravity from the Ground Up, Cambridge University Press,\n2003.\n[30] Monien. B and Speckenmeyer. E: Ramsey numbers and an approximation\nalgorithm for the vertex cover problems, Acta Informatica, vol. 22,\npp. 115 - 123, 1985.\n[31] Shyu. S.J, Yin. P.Y and Lin. B.M.T: An ant colony optimization\nalgorithm for the minimum weight vertex cover problem, Annals of\nOperations Research, Vol. 131, pp. 283 - 304, 2004.\n[32] Weight. M and Hartmann. A. K: The number of guards needed by a\nmuseum - a phase transition in vertex covering of random graphs., Phys\n- Rev. Lett., 84, 6118, 2000b.\n[33] Weight. M and Hartmann. A. K.: Minimal vertex covers on finite\nconnectivity random graphs - A hard-sphere lattice-gas picture, Phys.\nRev. E, 63, 056127."]}

A new Meta heuristic approach called "Randomized gravitational emulation search algorithm (RGES)" for solving vertex covering problems has been designed. This algorithm is found upon introducing randomization concept along with the two of the four primary parameters -velocity- and -gravity- in physics. A new heuristic operator is introduced in the domain of RGES to maintain feasibility specifically for the vertex covering problem to yield best solutions. The performance of this algorithm has been evaluated on a large set of benchmark problems from OR-library. Computational results showed that the randomized gravitational emulation search algorithm - based heuristic is capable of producing high quality solutions. The performance of this heuristic when compared with other existing heuristic algorithms is found to be excellent in terms of solution quality.