Quasi-Polynomial Time Approximation Schemes for Packing and Covering Problems in Planar Graphs.

Michal Pilipczuk, Erik Jan van Leeuwen, Andreas Wiese

Browse the full ESA paper archive.