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

Michal Pilipczuk, Erik Jan van Leeuwen, Andreas Wiese. Quasi-Polynomial Time Approximation Schemes for Packing and Covering Problems in Planar Graphs. Algorithmica, 82(6):1703-1739, 2020. [doi]

Abstract

Abstract is missing.