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

Michal Pilipczuk, Erik Jan van Leeuwen, Andreas Wiese

Research output: Contribution to JournalArticleAcademicpeer-review

Original languageUndefined/Unknown
Pages (from-to)1703-1739
Number of pages37
JournalAlgorithmica
Volume82
Issue number6
DOIs
Publication statusPublished - 2020
Externally publishedYes

Cite this