Approximation and parameterized algorithms for covering disjointness-compliable set families

Zeev Nutov, Anael Vaknin

A set-family $\mathcal{F}$ is disjointness-compliable if $A^{\prime }\subseteq A\in \mathcal{F}$ implies $A^{\prime }\in \mathcal{F}$ or $A\setminus A^{\prime }\in \mathcal{F}$; if $\mathcal{F}$ is also symmetric then…