The set covering problem asks for the smallest collection of subsets whose union contains all elements in a given universe. As a canonical NP-hard challenge, it has inspired a rich array of exact, ...

The vertex cover problem seeks a minimum-cardinality set of vertices in a graph such that every edge is incident to at least one selected vertex. As an NP-hard combinatorial optimisation challenge, it ...