An Exact Algorithm for Minimum Vertex Cover Problem
Keyword(s):
In this paper, we propose a branch-and-bound algorithm to solve exactly the minimum vertex cover (MVC) problem. Since a tight lower bound for MVC has a significant influence on the efficiency of a branch-and-bound algorithm, we define two novel lower bounds to help prune the search space. One is based on the degree of vertices, and the other is based on MaxSAT reasoning. The experiment confirms that our algorithm is faster than previous exact algorithms and can find better results than heuristic algorithms.
2017 ◽
Vol 2017
◽
pp. 1-15
◽
Keyword(s):
Keyword(s):
2009 ◽
Vol 15
(2)
◽
pp. 310-325
◽
2016 ◽
Vol 55
◽
pp. 653-683
◽
Keyword(s):
2015 ◽
Vol 07
(03)
◽
pp. 1550032
◽
Keyword(s):