Approximating Connected Safe Sets in Weighted Trees

Stefan Ehard, Dieter Rautenbach

For a graph $G$ and a non-negative integral weight function $w$ on the vertex set of $G$, a set $S$ of vertices of $G$ is $w$-safe if $w(C)\ge w(D)$ for every component $C$ of the…