Vertex Cover Interdiction in Bipartite Graphs

Takehiro Ito, Naonori Kakimura, Naoyuki Kamiyama +2

In the vertex cover interdiction problem, we are given an undirected graph $G=(V,E)$, two integers $t$ and $k$ and a vertex subset $B\subseteq V$, and we are asked to find a set $X…