Knapsack with Vertex Cover, Set Cover, and Hitting Set

Palash Dey, Ashlesha Hota, Sudeshna Kolay +1

Given an undirected graph $\mathcal{G}=(\mathcal{V},\mathcal{E})$, with vertex weights $(w(u){)}_{u\in \mathcal{V}}$, vertex values $(\alpha (u){)}_{u\in \mathcal{V}}$, a knapsack size $s$, an…