This page lists the scientific contributions of an author, who either does not have a ResearchGate profile, or has not yet added these contributions to their profile.
It was automatically created by ResearchGate to create a record of this author's body of work. We create such pages to advance our goal of creating and maintaining the most comprehensive scientific repository possible. In doing so, we process publicly available (personal) data relating to the author as a member of the scientific community.
If you're a ResearchGate member, you can follow this page to keep up with this author's work.
If you are this author, and you don't want us to display this page anymore, please let us know.
March 2015
·
18 Reads
·
1 Citation
The minimum vertex cover (MVC) problem is a well-studied NP-Complete problem and has various applications. In this paper, a new heuristic approach has been proposed to find the minimum vertex cover of a graph the proposed algorithm has been tested on random graphs and BHOSLIB instances the results have shown that the proposed algorithm can yield better solutions especially on dense graphs for solving the minimum vertex cover problem.
... Some parameterized algorithms about MVCP have been applied in biochemistry [23,24]. Moreover, the optimal approximation algorithm for MVCP have been proposed in [25][26][27][28][29][30]. Authors in [25][26][27][28][29][30] proposed the approximate optimization algorithm for MVCP by using the concept of degree. ...
March 2015
