Login / Signup

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

Michal PilipczukErik Jan van LeeuwenAndreas Wiese
Published in: ESA (2018)
Keyphrases
  • approximation schemes
  • planar graphs
  • approximation algorithms
  • computational complexity
  • np complete