Parameterized algorithms for Partial vertex covers in bipartite graphs

Vahan Mkrtchyan, Garik Petrosyan, K. Subramani

In the weighted partial vertex cover problem (WPVC), we are given a graph $G=(V,E)$, cost function $c:V\to N$, profit function $p:E\to N$, and positive integers $R$…