Exact approaches for the Connected Vertex Cover problem
From MaRDI portal
Abstract: Given a graph , the Connected Vertex Cover problem (CVC) asks to find a minimum cardinality vertex cover of that induces a connected subgraph. In this paper we describe some approaches to solve the CVC problem exactly. First, we give compact mixed-integer extended formulations for CVC: these are the first formulations proposed for this problem, and can be easily adapted to variations of the problem such as Tree Cover. Second, we describe a simple branch and bound algorithm for the CVC problem. Finally, we implement our algorithm and compare its performance against our best formulation: contrary to what usually happens for the classical Vertex Cover problem, our formulation outperforms the branch and bound algorithm.
This page was built for publication: Exact approaches for the Connected Vertex Cover problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6394058)
