An Exact Algorithm for Minimum Weight Vertex Cover Problem in Large Graphs

03/14/2019
by   Luzhi Wang, et al.
0

This paper proposes a novel branch-and-bound(BMWVC) algorithm to exactly solve the minimum weight vertex cover problem (MWVC) in large graphs. The original contribution is several new graph reduction rules, allowing to reduce a graph G and the time needed to find a minimum weight vertex cover in G. Experiments on large graphs from real-world applications show that the reduction rules are effective and the resulting BMWVC algorithm outperforms relevant exact and heuristic MWVC algorithms.

READ FULL TEXT

Please sign up or login with your details

Forgot password? Click here to reset