What

It’s an algorithmic NP Complete problem.

Imagine a graph, and you have the goal of choosing the minimum number of vertices (nodes) such that all edges have a connection to a chosen node.

The graph below has a minimum vertex cover (in red)