Login / Signup

Polynomial-Time Approximation Schemes for Subset-Connectivity Problems in Bounded-Genus Graphs.

Glencora BorradaileErik D. DemaineSiamak Tazari
Published in: STACS (2009)
Keyphrases
  • approximation schemes
  • approximation algorithms
  • special case
  • computer vision
  • higher order
  • optimization problems
  • np hardness