Approximation algorithms for hitting subgraphs

Noah Brüstle, Tal Elbaz, Hamed Hatami +2

Let $H$ be a fixed undirected graph on $k$ vertices. The $H$-hitting set problem asks for deleting a minimum number of vertices from a given graph $G$ in such a way that the result…