Preprint
Sep 2026
Vertex Cover Interdiction in Bipartite Graphs
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 \subseteq B$ with $|X|\leq t$ such that $X$ hits (i.e., intersects) all the vertex covers of $G$ of size at most $k$. Recently, Gr\"une and...
Takehiro Ito, Naonori Kakimura, N. Kamiyama et al.
· 0 citations