A Near-Linear Element-Kernel for d-Hitting SetResearch Paper
-Hitting Set is a central covering problem of parameterized complexity: many deletion problems whose obstructions have bounded size (Cluster Vertex Deletion, Feedback Vertex Set in Tournaments, Split Vertex Deletion, -Path Vertex Cover) are instances of it. A kernel shrinks an instance in polynomial time to an equivalent one whose size depends on the…