An Exact Algorithm for Minimum Weight Vertex Cover Problem in Large Graphs
Data Structures and Algorithms
2019-03-15 v1 Discrete Mathematics
Abstract
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.
Keywords
Cite
@article{arxiv.1903.05948,
title = {An Exact Algorithm for Minimum Weight Vertex Cover Problem in Large Graphs},
author = {Luzhi Wang and Chu-Min Li and Junping Zhou and Bo Jin and Minghao Yin},
journal= {arXiv preprint arXiv:1903.05948},
year = {2019}
}