Login / Signup

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

Michal PilipczukErik Jan van LeeuwenAndreas Wiese
Published in: Algorithmica (2020)
Keyphrases
  • approximation schemes
  • planar graphs
  • approximation algorithms
  • special case
  • image processing
  • np complete
  • numerical methods
  • optimization problems
  • packing problem
  • search algorithm