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.- Sort by
- Weight
- Alphabetically
Quasi-Polynomial Time Approximation Schemes for Packing and Covering Problems in Planar Graphs
Michał Pilipczuk, Erik Jan van Leeuwen, Andreas Wiese
Research output: Contribution to journal › Article › peer-review
5
Scopus
citations