# Vertex cover

### From Glossary

Given a graph,
a *vertex cover* is a subset of say such that for each edge
at least one of and is in Given weights, for the *weight* of a vertex cover is the sum of weights of the nodes in The *minimum weight vertex cover problem* is to find a vertex cover whose weight is minimum. (Also see the covering problem and the maximum weight independent set problem.)