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]
@article{PilipczukLW20,
title = {Quasi-Polynomial Time Approximation Schemes for Packing and Covering Problems in Planar Graphs},
author = {Michal Pilipczuk and Erik Jan van Leeuwen and Andreas Wiese},
year = {2020},
doi = {10.1007/s00453-019-00670-w},
url = {https://doi.org/10.1007/s00453-019-00670-w},
researchr = {https://researchr.org/publication/PilipczukLW20},
cites = {0},
citedby = {0},
journal = {Algorithmica},
volume = {82},
number = {6},
pages = {1703-1739},
}