Abstract
In this paper, an efficient local search framework, namely GRASP-PVC, is proposed to solve the minimum partial vertex cover problem. In order to speed up the convergence, a novel least-cost vertex selecting strategy is applied into GRASP-PVC. As far as we know, no heuristic algorithms have ever been reported to solve this momentous problem and we compare GRASP-PVC with a commercial integer programming solver CPLEX as well as a 2-approximation algorithm on two standard benchmark libraries called DIMACS and BHOSLIB. Experimental results evince that GRASP-PVC finds much better partial vertex covers than CPLEX and the approximation algorithm on most instances. Additional experimental results also confirm the validity of the least-cost vertex selecting strategy.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
