Smallest set that intersects some given sets
Your first problem is the hypergraph transversal problem (aka the HITTING SET problem). The second problem is the FEEDBACK VERTEX&nbsp;SET problem. Both the problems are NP-complete.