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

Michal Pilipczuk Erik Jan van Leeuwen Andreas Wiese

Published in: CoRR (2018)

Keyphrases

approximation schemes
planar graphs
approximation algorithms
special case
optimization problems
multiscale
computational complexity
pairwise
branch and bound
numerical methods