An $O(\log OPT)$-approximation for covering and packing minor models of ${\theta }_r$

Dimitris Chatzidimitriou, Jean-Florent Raymond, Ignasi Sau +1

Given two graphs $G$ and $H$, we define ${\text{v-cover}}_H(G)$ (resp. ${\text{e-cover}}_H(G)$) as the minimum number of vertices (resp. edges) whose removal from $G$ produces…