An $O(\log \mathrm {OPT})$-Approximation for Covering and Packing Minor Models of $\theta _r$

Dimitris Chatzidimitriou (1) , Jean-Florent Raymond (2, 3) , Ignasi Sau (2) , Dimitrios M. Thilikos (2)

1 Department of Mathematics [Athens]
2 ALGCO - Algorithmes, Graphes et Combinatoire
3 MIMUW - Faculty of Mathematics, Informatics, and Mechanics [Warsaw]

Mots clés: Protrusion decomposition; Minor-models of θ; Coverings in graph; Erdős–Pósa property; Approximation algorithm; Packings in graphs

Domaines: Mathématique discrète [cs.DM]; Algorithme et structure de données [cs.DS]

Dimitris Chatzidimitriou, Jean-Florent Raymond, Ignasi Sau, Dimitrios M. Thilikos. An $O(\log \mathrm {OPT})$-Approximation for Covering and Packing Minor Models of $\theta _r$. Algorithmica, 2018, 80 (4), pp.1330-1356. ⟨10.1007/s00453-017-0313-5⟩. ⟨lirmm-01609998⟩