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

Michał Pilipczuk, Erik Jan Van Leeuwen, Andreas Wiese

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

1 Scopus citations

Fingerprint

Dive into the research topics of 'Quasi-polynomial time approximation schemes for packing and covering problems in planar graphs'. Together they form a unique fingerprint.

Mathematics

Keyphrases