Quasi-polynomial time approximation schemes for packing and covering problems in planar graphs

Michał Pilipczuk, Erik Jan van Leeuwen, Andreas Wiese

We consider two optimization problems in planar graphs. In Maximum Weight Independent Set of Objects we are given a graph $G$ and a family $\mathcal{D}$ of objects, each being a co…